Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083216
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083216 Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2). +0
7
20615674205555510, 3794765361567513, 24410439567123023, 28205204928690536, 52615644495813559, 80820849424504095, 133436493920317654, 214257343344821749, 347693837265139403, 561951180609961152 (list; graph; listen)
OFFSET

0,1

COMMENT

a(0) = 20615674205555510, a(1) = 3794765361567513. 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 Herbert Wilf in 1990.

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, A082411.

Sequence in context: A141621 A098143 A095432 this_sequence A145065 A080127 A003941

Adjacent sequences: A083213 A083214 A083215 this_sequence A083217 A083218 A083219

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research