This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A263541 #14 Oct 21 2015 18:04:11 %S A263541 1,2,4,6,40,43,705,789,1148,2140,4276,5512,6672,8754,38434,174501, %T A263541 493578,598249,628064,702774,1368196,4584004,13813057,36425906, %U A263541 87964443,447997476,1964288296 %N A263541 Numbers k such that k divides the sum of the first k primes with prime indices. %C A263541 There are 8 values of a(n) < 1000 although A045345 has 4 values A045345(n) < 1000. How do these sequences compare asymptotically? %C A263541 Heuristics suggest that the ratio of the number of terms in each sequence up to x should approach 1 as x increases without bound. In the Cramér model, log a(n) and log A045345(n) are Erlang-distributed with shape n and rate 1. - _Charles R Greathouse IV_, Oct 20 2015 %e A263541 1 is in the sequence because prime(prime(1)) = 3 is divisible by 1. %e A263541 2 is in the sequence because prime(prime(1)) + prime(prime(2)) = 3 + 5 = 8 is divisible by 2. %o A263541 (PARI) list(lim)=my(v=List(),k,s,t); forprime(p=2,, if(isprime(t++), s+=p; k++; if(s%k==0, listput(v, k)); if(k>=lim, return(Vec(v))))) \\ _Charles R Greathouse IV_, Oct 20 2015 %Y A263541 Cf. A006450, A045345, A083186. %K A263541 nonn %O A263541 1,2 %A A263541 _Altug Alkan_, Oct 20 2015 %E A263541 a(12)-a(26) from _Charles R Greathouse IV_, Oct 20 2015 %E A263541 a(27) from _Charles R Greathouse IV_, Oct 21 2015