|
Search: id:A082411
|
|
|
| A082411 |
|
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2). |
|
+0
4
|
|
| 407389224418, 76343678551, 483732902969, 560076581520, 1043809484489, 1603886066009, 2647695550498, 4251581616507, 6899277167005, 11150858783512, 18050135950517, 29200994734029, 47251130684546, 76452125418575
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(0) = 407389224418, a(1) = 76343678551. This is a second-order linear recurrence sequence with a(0) and a(1) coprime that does not contain any primes. It was found by John Nicol in 1999.
|
|
REFERENCES
|
R. L. Graham, Math. Mag. 37, 1964, pp. 322-324.
D. E. Knuth, Math. Mag. 63, 1990, pp. 21-25.
H. S. Wilf, Letters to the Editor, Math. Mag. 63, 1990.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
J. W. Nicol, A Fibonacci-like sequence of composite numbers
|
|
CROSSREFS
|
Cf. A000032 (Lucas numbers), A000045 (Fibonacci numbers), A083103, A083104, A083105, A083216.
Sequence in context: A022263 A080132 A080122 this_sequence A113952 A104303 A105302
Adjacent sequences: A082408 A082409 A082410 this_sequence A082412 A082413 A082414
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Harry J. Smith (hjsmithh(AT)sbcglobal.net), Apr 23 2003
|
|
|
Search completed in 0.002 seconds
|
