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 A000076 M1079 N0409 #22 Sep 24 2020 15:14:16 %S A000076 0,0,1,2,4,7,14,24,43,82,149,284,534,1015,1937,3713,7136,13759,26597, %T A000076 51537,100045,194586,378987,739161,1443465,2821923,5522689,10818037, %U A000076 21208747,41612533,81704494,160531078,315602635,620831732,1221915127,2406177404,4740454046,9343415302,18423548106,36342329321 %N A000076 Number of integers <= 2^n of form 4 x^2 + 4 x y + 5 y^2. %C A000076 Rewriting the expression as (2 x + y)^2 + 4 y^2 facilitates an efficient search without negative terms. - _Bert Dobbelaere_, Sep 24 2020 %D A000076 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A000076 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A000076 D. Shanks and L. P. Schmid, <a href="http://dx.doi.org/10.1090/S0025-5718-1966-0210678-1">Variations on a theorem of Landau. Part I</a>, Math. Comp., 20 (1966), 551-569. %H A000076 <a href="/index/Qua#quadpop">Index entries for sequences related to populations of quadratic forms</a> %e A000076 a(4)=4 since 2^4=16 and 4=4*1^2, 5=5*1^2, 13=4*1^2+4*1*1+5*1^2, 16=4*2^2. %o A000076 (PARI) a(n)=if(n<0,0,sum(k=1,2^n,0<sum(j=0,sqrtint(k)\2,issquare(k-4*j^2)&(k-j)%2==0))) %K A000076 nonn %O A000076 0,4 %A A000076 _N. J. A. Sloane_ %E A000076 a(27)-a(39) from _Bert Dobbelaere_, Sep 24 2020