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 A083186 #22 Jul 06 2024 05:18:46
%S A083186 3,8,19,36,67,108,167,234,317,426,553,710,889,1080,1291,1532,1809,
%T A083186 2092,2423,2776,3143,3544,3975,4436,4945,5492,6055,6642,7241,7858,
%U A083186 8567,9306,10079,10876,11735,12612,13531,14498,15489,16520,17583,18670,19823
%N A083186 Sum of the first n primes whose indices are primes.
%C A083186 Partial sums of A006450.
%H A083186 Amiram Eldar, <a href="/A083186/b083186.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale)
%F A083186 a(n) = Sum_{k=1..n} prime(prime(k)).
%F A083186 a(n) ~ (n log n)^2 / 2. - _Charles R Greathouse IV_, Oct 20 2015
%t A083186 Accumulate[Prime[Prime[Range[50]]]] (* _Harvey P. Dale_, Jun 24 2012 *)
%o A083186 (PARI) pipsum(n)=s=0; sr=0; for(x=1,n, y=prime(prime(x)); s+=y; print1(s" "); sr+=1.0/y; ); print(); print(sr)
%o A083186 (PARI) a(n)=my(i,j,s); forprime(p=2,, if(isprime(i++), s+=p; if(j++==n, return(s)))) \\ _Charles R Greathouse IV_, Oct 20 2015
%o A083186 (PARI) first(n)=my(v=vector(n),i,j,s); forprime(p=2,, if(isprime(i++), s+=p; v[j++]=s; if(j==n, return(v)))) \\ _Charles R Greathouse IV_, Oct 20 2015
%Y A083186 Cf. A006450, A109790.
%K A083186 nonn
%O A083186 1,1
%A A083186 _Cino Hilliard_, Jun 01 2003