|
Search: id:A129728
|
|
|
| A129728 |
|
A palindromic complexity sequence based on the Fibonacci numbers. |
|
+0
1
|
|
| 1, 3, 6, 9, 13, 18, 25, 35, 50, 73, 109, 166, 257, 403, 638, 1017, 1629, 2618, 4217, 6803, 10986, 17753, 28701, 46414, 75073, 121443, 196470, 317865, 514285, 832098, 1346329, 2178371, 3524642, 5702953, 9227533, 14930422, 24157889, 39088243
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
P[1]=1 gives more primes than P[1]=2 for some reason.
|
|
REFERENCES
|
Petr Ambroz, Christiane Frougny, Zuzana Masakova and Edita Pelantova, Palindromic complexity of infinite words associated with simple Parry numbers, arXiv:math/0603608.
|
|
FORMULA
|
a(n) = a(n-1)+Fibonacci[n]-Fibonacci[n-1]+2
|
|
MATHEMATICA
|
P[1] = 1; P[n_] := P[n] = P[n - 1] + Fibonacci[n] - Fibonacci[n - 1] + 2; Table[P[n], {n, 1, 50}]
|
|
CROSSREFS
|
Adjacent sequences: A129725 A129726 A129727 this_sequence A129729 A129730 A129731
Sequence in context: A033436 A002578 A059293 this_sequence A117469 A073359 A137041
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), May 12 2007
|
|
|
Search completed in 0.002 seconds
|
