|
Search: id:A083105
|
|
|
| A083105 |
|
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2). |
|
+0
5
|
|
| 62638280004239857, 49463435743205655, 112101715747445512, 161565151490651167, 273666867238096679, 435232018728747846, 708898885966844525, 1144130904695592371, 1853029790662436896
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(0) = 62638280004239857, a(1) = 49463435743205655. 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 D. E. Knuth in 1990.
|
|
REFERENCES
|
R. L. Graham, Math. Mag. 37, 1964, pp. 322-324.
D. E. Knuth, Math. Mag. 63, 1990, pp. 21-25.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
J. W. Nicol, A Fibonacci-like sequence of composite numbers
Prime Puzzles, Problem 31. Fibonacci- all composites sequence
|
|
CROSSREFS
|
Cf. A000032 (Lucas numbers), A000045 (Fibonacci numbers), A083103, A083104, A083216, A082411.
Sequence in context: A038362 A038363 A051167 this_sequence A115499 A104837 A008923
Adjacent sequences: A083102 A083103 A083104 this_sequence A083106 A083107 A083108
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Harry J. Smith (hjsmithh(AT)sbcglobal.net), Apr 23 2003
|
|
|
Search completed in 0.002 seconds
|
