login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083103 Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2). 4
1786772701928802632268715130455793, 1059683225053915111058165141686995, 2846455926982717743326880272142788, 3906139152036632854385045413829783, 6752595079019350597711925685972571, 10658734231055983452096971099802354 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

a(0) = 1786772701928802632268715130455793, a(1) = 1059683225053915111058165141686995. This is the second-order linear recurrence sequence with a(0) and a(1) co- prime, that R. L. Graham in 1964 stated did not contain any primes. It has not been verified. Graham made a mistake in the calculation that was corrected by D. E. Knuth in 1990.

REFERENCES

R. L. Graham, Math. Mag. 37, 1964, pp. 322-324.

P. Ribenboim, The Little Book of Big Primes. Springer-Verlag, 1991, p. 178.

LINKS

Tanya Khovanova, Recursive Sequences

Prime Puzzles, Problem 31. Fibonacci- all composites sequence

MATHEMATICA

LinearRecurrence[{1, 1}, {1786772701928802632268715130455793, 1059683225053915111058165141686995}, 70] (* From Harvey P. Dale, Oct 17 2011 *)

CROSSREFS

Cf. A000032 (Lucas numbers), A000045 (Fibonacci numbers), A083104, A083105.

Sequence in context: A083104 A115531 A095460 * A115532 A074194 A135386

Adjacent sequences:  A083100 A083101 A083102 * A083104 A083105 A083106

KEYWORD

nonn

AUTHOR

Harry J. Smith (hjsmithh(AT)sbcglobal.net), Apr 22 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 12 02:53 EST 2012. Contains 205360 sequences.