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 A245077 #9 Jul 12 2014 22:44:20 %S A245077 2,1,1,2,1,2,2,1,2,2,1,2,2,1,3,3,2,1,3,2,3,3,2,3,2,2,3,2,2,3,3,2,2,3, %T A245077 2,3,3,2,2,4,2,4,2,2,4,2,2,1,4,2,4,4,2,4,4,2,4,2,2,1,2,1,1,4 %N A245077 Largest k such that the smallest prime satisfying Goldbach's conjecture is less than or equal to (2n)^(1/k). %C A245077 The 1's appear as in A244408. %H A245077 Jens Kruse Andersen, <a href="/A245077/b245077.txt">Table of n, a(n) for n = 2..10000</a> %e A245077 For n=5 we have 3+7=10. As rt3(10)<3<sqrt(10), a(5)=2. %o A245077 (PARI) for (n=2, 100, p=2; while(!isprime(2*n-p), p=nextprime(p+1)); k=1; while(p<=(2*n)^(1/k), k++); print1(k-1", ")) \\ _Jens Kruse Andersen_, Jul 12 2014 %Y A245077 Cf. A244408. %Y A245077 Cf. A020481, A002373, A025018, A025019. %K A245077 nonn %O A245077 2,1 %A A245077 _Jon Perry_, Jul 11 2014 %E A245077 Definition corrected by _Jens Kruse Andersen_, Jul 12 2014