|
Search: id:A129726
|
|
|
| A129726 |
|
A palindromic complexity sequence based on the primes. |
|
+0
1
|
|
| 2, 5, 9, 13, 19, 23, 29, 33, 39, 47, 51, 59, 65, 69, 75, 83, 91, 95, 103, 109, 113, 121, 127, 135, 145, 151, 155, 161, 165, 171, 187, 193, 201, 205, 217, 221, 229, 237, 243, 251, 259, 263, 275, 279, 285, 289, 303, 317, 323, 327
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Since the form P(n)=P(n-1)+C(n)-C(n-1)+2 reminded me of a prime gap, I tried this. It gives 36 primes in the first 100 ( largest run of 4 in a row): a = Table[If[PrimeQ[P[n]], 1, 0], {n, 1, 100}]; Apply[Plus, a]
|
|
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)+Prime[n]-Prime[n-1]+2
|
|
MATHEMATICA
|
P[1] = 2; P[n_] := P[n] = P[n - 1] + Prime[n] - Prime[n - 1] + 2; Table[P[n], {n, 1, 50}]
|
|
CROSSREFS
|
Sequence in context: A161569 A055025 A130235 this_sequence A122489 A120615 A038707
Adjacent sequences: A129723 A129724 A129725 this_sequence A129727 A129728 A129729
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), May 12 2007
|
|
|
Search completed in 0.002 seconds
|
