|
Search: id:A055500
|
|
|
| A055500 |
|
a(0)=1, a(1)=1, a(n) = largest prime <= a(n-1)+a(n-2). |
|
+0
7
|
|
| 1, 1, 2, 3, 5, 7, 11, 17, 23, 37, 59, 89, 139, 227, 359, 577, 929, 1499, 2423, 3919, 6337, 10253, 16573, 26821, 43391, 70207, 113591, 183797, 297377, 481171, 778541, 1259701, 2038217, 3297913, 5336129, 8633983, 13970093, 22604069
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Might be called the Prime-Fibonacci sequence. - Bodo Zinser (BodoZinser(AT)Compuserve.com), Nov 17 2001
|
|
LINKS
|
Zak Seidov, Table of n, a(n) for n = 0..100.
|
|
FORMULA
|
a(n) is asymptotic to C*phi^n where phi=(1+sqrt(5))/2 and C=0.25861637901860700965101922576495456677... - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 21 2003
|
|
EXAMPLE
|
a(9) = 23 because 23 is largest prime <= a(7)+a(6) = 17+11 = 28
|
|
MATHEMATICA
|
PrevPrim[n_] := Block[ {k = n}, While[ !PrimeQ[k], k-- ]; Return[k]]; a[1] = a[2] = 1; a[n_] := a[n] = PrevPrim[ a[n - 1] + a[n - 2]]; Table[ a[n], {n, 1, 42} ]
|
|
CROSSREFS
|
Cf. A055498-A055502, A065435, A000045.
Sequence in context: A104892 A065436 A068523 this_sequence A018058 A002379 A072465
Adjacent sequences: A055497 A055498 A055499 this_sequence A055501 A055502 A055503
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jul 08 2000
|
|
|
Search completed in 0.002 seconds
|
