|
Search: id:A082246
|
|
|
| A082246 |
|
Primes that are the sum of 7 consecutive primes. |
|
+0
9
|
|
| 197, 223, 251, 281, 311, 401, 431, 463, 523, 593, 659, 719, 757, 827, 863, 947, 991, 1063, 1171, 1753, 1901, 2347, 2393, 2647, 2689, 2731, 2777, 2819, 2953, 3347, 3389, 3533, 3643, 3701, 3761, 3821, 4177, 4217, 4451, 4493, 5507, 5717, 5849, 5927, 6029
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
2+3+5+7+11+13+17 = 58
3+5+7+11+13+17+19 = 75
5+7+11+13+17+19+23 = 95
7+11+13+17+19+23+29 = 119 = 7*17
11+13+17+19+23+29+31 = 143 = 11*13
13+17+19+23+29+31+37 = 169 = 13*13
17+19+23+29+31+37+41 = 197 = prime
|
|
MATHEMATICA
|
Clear[Sum7Primes]; Sum7Primes[a_]:=Module[{p}, p=Prime[a]+Prime[a+1]+Prime[a+2]+Prime[a+3]+Prime[a+4]+Prime[a+5]+Prime[a+6]]; lst={}; Do[If[PrimeQ[p=Sum7Primes[n]], AppendTo[lst, p]], {n, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 06 2009]
|
|
PROGRAM
|
(PARI) \primes in the sum of m odd number of consecutive primes. m=7 psumprm(m, n) = { sr=0; s=0; for(j=1, m, s+=prime(j); ); for(x=1, n, s = s - prime(x)+ prime(x+m); if(isprime(s), sr+=1.0/s; print1(s" ")); ); print(); print(sr) }
|
|
CROSSREFS
|
Sequence in context: A043664 A061276 A162873 this_sequence A159809 A051371 A127339
Adjacent sequences: A082243 A082244 A082245 this_sequence A082247 A082248 A082249
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), May 09 2003
|
|
EXTENSIONS
|
Corrected by Michael Somos, Feb 01, 2004
|
|
|
Search completed in 0.002 seconds
|
