login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A082534
Greatest prime p such that p can be expressed as the sum of consecutive primes with largest prime in the sum = n-th prime.
4
2, 5, 5, 17, 23, 41, 53, 67, 83, 127, 83, 197, 233, 281, 311, 379, 311, 499, 563, 479, 431, 733, 857, 953, 1019, 1151, 1259, 1361, 1439, 1583, 1523, 1823, 1607, 2099, 1637, 2417, 2579, 2719, 2909, 2927, 3137, 3389, 3257, 3821, 3527, 4217, 4421, 4651, 4871
OFFSET
1,1
LINKS
EXAMPLE
For n=10; 29 is the 10th prime, largest prime in the sum = 29. 29=29, 71=19+23+29, 101=13+17+19+23+29, 127=3+5+7+11+13+17+19+23+29. 29 and 71,101,127 are primes. 127 is the greatest prime, so a(10)=127.
PROG
(PARI) for(n=1, 1000, s=0; forstep(j=n, 1, -1, s=s+prime(j); if(isprime(s), p=s)); write("b082534.txt", n " " p)) /* Donovan Johnson, Apr 10 2013 */
CROSSREFS
Sequence in context: A259036 A081235 A219586 * A165659 A154816 A367299
KEYWORD
easy,nonn
AUTHOR
Naohiro Nomoto, May 02 2003
STATUS
approved