|
Search: id:A108867
|
|
|
| A108867 |
|
a(1) = 1; a(n) = sum of previous terms a(k) such that a(k) + n is prime. |
|
+0
1
|
|
| 1, 1, 0, 2, 2, 2, 0, 0, 6, 2, 14, 2, 6, 0, 24, 2, 62, 2, 24, 0, 76, 2, 74, 0, 88, 0, 242, 2, 396, 2, 88, 0, 164, 0, 1018, 2, 532, 0, 1122, 2, 1462, 2, 1638, 0, 1652, 2, 2348, 0, 2808, 0, 3950, 2, 7254, 0, 9560, 0, 5720, 2, 18298, 2, 4292, 0, 22068, 0, 28528, 2, 8194, 0, 76236, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
Among the first 10 terms, a(3)+11, a(4)+11, a(5)+11, a(6)+11, a(7)+11, a(8)+11, a(9)+11 and a(10)+11 are primes. So a(11) = a(3)+a(4)+a(5)+a(6)+a(7)+a(8)+a(9)+a(10) = 14.
|
|
PROGRAM
|
(PARI) {m=70; v=[1]; for(n=2, m, c=0; for(j=1, length(v), if(isprime(v[j]+n), c=c+v[j])); v=concat(v, c)); for(j=1, m, print1(v[j], ", "))}
|
|
CROSSREFS
|
Sequence in context: A034852 A112790 A110857 this_sequence A095767 A071446 A071469
Adjacent sequences: A108864 A108865 A108866 this_sequence A108868 A108869 A108870
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jul 30 2005
|
|
EXTENSIONS
|
More terms and PARI code from Klaus Brockhaus (klaus-brockhaus(AT)t.online.de), Aug 04 2005
|
|
|
Search completed in 0.002 seconds
|
