|
Search: id:A098598
|
|
|
| A098598 |
|
Number of primes in sequences formed from the t digits of n where the latter terms are given by rule b(i)=sum of t previous terms; primes are counted from initial t digits up to the largest term < n^2. |
|
+0
4
|
|
| 5, 5, 5, 5, 5, 5, 4, 3, 4, 2, 3, 7, 2, 6, 1, 6, 1, 5, 1, 4, 3, 6, 7, 2, 7, 5, 1, 5, 5, 1, 0, 6, 1, 5, 0, 6, 0, 7, 0, 5, 3, 6, 7, 6, 6, 2, 6, 7, 5, 6, 0, 5, 1, 1, 0, 6, 0, 5, 0, 0, 3, 5, 6, 5, 5, 5, 6, 2, 5, 5, 0, 3, 1, 4, 0, 4, 0, 5, 0, 4, 0, 4, 8, 1, 3, 4, 0, 6, 6, 0, 4, 4, 6, 3, 4, 3, 3, 3, 2, 4, 6, 7, 4, 7, 2
(list; graph; listen)
|
|
|
OFFSET
|
10,1
|
|
|
EXAMPLE
|
a(21)=7 because there are 7 primes in the sequence
2,1,3,4,7,11,18,29,47,76,123,199,322.
|
|
CROSSREFS
|
Cf. A007629, A073882.
Sequence in context: A093704 A112110 A142864 this_sequence A010716 A021022 A032560
Adjacent sequences: A098595 A098596 A098597 this_sequence A098599 A098600 A098601
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Sep 17 2004
|
|
|
Search completed in 0.002 seconds
|
