Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055498
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055498 a(0)=0, a(1)=1, a(n) = smallest prime >= a(n-1)+a(n-2). +0
7
0, 1, 2, 3, 5, 11, 17, 29, 47, 79, 127, 211, 347, 563, 911, 1481, 2393, 3877, 6271, 10151, 16427, 26591, 43019, 69623, 112643, 182279, 294923, 477209, 772139, 1249361, 2021501, 3270863, 5292367, 8563237, 13855607, 22418849, 36274471 (list; graph; listen)
OFFSET

0,3

LINKS

Zak Seidov, Table of n, a(n) for n = 0..100.

FORMULA

a(n+1)=nextprime(a(n)+a(n-1)) where nextprime(n) is smallest prime >= n.

a(n) is asymptotic to c*phi^n where phi=(1+sqrt(5))/2 and c= 1.086541275044988562375... - Benoit Cloitre (benoit7848c(AT)orange.fr), May 02 2004

EXAMPLE

After 3,5, the next prime >=8 is 11.

PROGRAM

(PARI) a(n)=local(v); if(n<2, n>=0, n++; v=vector(n, i, 1); for(i=3, n, v[i]=nextprime(v[i-1]+v[i-2])); v[n]) - Michael Somos Feb 01 2004

CROSSREFS

Cf. A073021, A073022, A055499-A055502.

Adjacent sequences: A055495 A055496 A055497 this_sequence A055499 A055500 A055501

Sequence in context: A124588 A059428 A084571 this_sequence A073021 A079370 A014210

KEYWORD

nonn

AUTHOR

njas, Jul 08 2000

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research