Search results
Jump to navigation
Jump to search
Page title matches
- In [[mathematics]], a '''Lucas sequence''' is a particular generalisation of sequences like the [[Fibonacci number| For every Lucas sequence the following are true:4 KB (776 words) - 20:44, 20 February 2010
- 12 bytes (1 word) - 00:49, 18 November 2007
- 155 bytes (19 words) - 07:05, 5 February 2009
- 207 bytes (27 words) - 10:40, 9 November 2009
- 136 bytes (13 words) - 17:46, 17 February 2008
Page text matches
- ...ath>a_n = a_{n-1} + a_{n-2}\ </math>, and both sequences are part of the [[Lucas sequence]] with the parameter P=1 and Q=(-1).798 bytes (117 words) - 04:00, 4 March 2008
- {{r|Lucas number||**}} {{r|Lucas sequence||}}395 bytes (45 words) - 07:44, 11 November 2009
- {{r|Lucas sequence}}432 bytes (56 words) - 18:11, 11 January 2010
- In [[mathematics]], a '''Lucas sequence''' is a particular generalisation of sequences like the [[Fibonacci number| For every Lucas sequence the following are true:4 KB (776 words) - 20:44, 20 February 2010
- {{r|Lucas sequence}}613 bytes (77 words) - 19:56, 11 January 2010
- {{r|Lucas sequence}}566 bytes (73 words) - 16:56, 11 January 2010
- More generally, a [[Lucas sequence]] satisfies3 KB (462 words) - 15:50, 14 December 2008