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 A305817 #5 Jun 15 2018 09:26:12
%S A305817 0,1,2,2,2,2,3,3,3,3,4,4,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,
%T A305817 7,7,8,8,8,8,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,11,11,12,
%U A305817 12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14
%N A305817 Number of terms of A091206 <= n; Partial sums of A305816.
%H A305817 Antti Karttunen, <a href="/A305817/b305817.txt">Table of n, a(n) for n = 1..65537</a>
%H A305817 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a>
%F A305817 a(1) = 0; for n > 1, a(n) = A305816(n-1) + a(n).
%F A305817 For all n >= 1, a(A091206(n)) = n.
%o A305817 (PARI)
%o A305817 up_to = 65537;
%o A305817 A305816(n) = (isprime(n)&&polisirreducible(Pol(binary(n))*Mod(1,2)));
%o A305817 partialsums(f,up_to) = { my(v = vector(up_to), s=0); for(i=1,up_to,s += f(i); v[i] = s); (v); }
%o A305817 v305817 = partialsums(A305816, up_to);
%o A305817 A305817(n) = v305817[n];
%Y A305817 Cf. A000720, A091206, A091226, A235043, A235044, A305816.
%K A305817 nonn
%O A305817 1,3
%A A305817 _Antti Karttunen_, Jun 15 2018