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 A146536 #30 Jan 21 2024 20:33:29
%S A146536 8,908,328184,69004076,11556327260,1707243198956,237064232862404,
%T A146536 31153163750203064,3947120494191630260,486665774050923191336,
%U A146536 58727077924563028184984
%N A146536 Sum of the first 10^n twin primes.
%C A146536 The author's Gcc/Gmp program is in the links section. The page also has the PARI bisection algorithms which give a very good approximation for the n-th prime number and the n-th lower twin prime number. The first 5 terms can be computed from the PARI script although 11556327260 takes 4 hours on a 2.53ghz 2 gig ram p4.
%H A146536 Cino Hilliard, <a href="http://groups.google.com/group/sumprimes/web/sumtwinsfirstn-c">Counting and summing primes</a> [Dead link]
%H A146536 Kevin Ryde, <a href="/A146536/a146536.c.txt">C Code</a>
%F A146536 a(n) = A086169(10^n). - _Andrew Howroyd_, Oct 22 2023
%e A146536 The 10^0-th twin prime pair is (3,5). This adds up to 8, the first entry in the sequence.
%e A146536 The first 10^1 twin prime pairs are (3,5),(5,7),(11,13) (17,19),(29,31),(41,43),(59,61),(71,73),(101,103),(107,109). This adds up to 908, the second entry in the table.
%o A146536 (C) // See links.
%o A146536 (PARI) a(n)={my(k=10^n,s=k,q); forprime(p=3, oo, if(p==q+2, s+=q; k--; if(!k, return(2*s))); q=p)} \\ _Andrew Howroyd_, Oct 22 2023
%Y A146536 Cf. A086169, A118552.
%K A146536 nonn,more
%O A146536 0,1
%A A146536 _Cino Hilliard_, Oct 31 2008
%E A146536 a(10) corrected by _Bill McEachen_, Oct 16 2023