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”).

A263549
Numbers k such that k divides the sum of the first k primes with odd indices.
0
1, 3, 67, 141, 2201, 2625, 8153, 10187, 11089, 136515, 138377, 1543419, 1712109, 5097739, 51562297, 1459124841, 42825210689
OFFSET
1,2
COMMENTS
a(n) is always an odd number since the first prime is 2.
How do a(n) and A263546(n) compare asymptotically?
EXAMPLE
1 is in the sequence because prime(1) = 2 is divisible by 1.
3 is in the sequence because prime(1) + prime(3) + prime(5) = 2 + 5 + 11 = 18 is divisible by 3.
MATHEMATICA
Select[Range@ 10000, Divisible[Sum[Prime[2 i - 1], {i, 1, #}], #] &] (* Michael De Vlieger, Oct 21 2015 *)
PROG
(PARI) list(lim)=my(v=List(), k, s, t); forprime(p=2, , if((t++) && t%2==1, s+=p; k++; if(s%k==0, listput(v, k)); if(k>=lim, return(Vec(v)))))
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Altug Alkan, Oct 21 2015
EXTENSIONS
a(17) from Amiram Eldar, Jun 03 2024
STATUS
approved