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 A010080 #18 Jul 08 2025 01:29:05
%S A010080 1,0,140,448,870,448,140,0,1
%N A010080 Weight distribution of [16,11,4] extended Hamming code of length 16.
%D A010080 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 129.
%H A010080 N. Heninger, E. M. Rains and N. J. A. Sloane, <a href="https://arxiv.org/abs/math/0509316">On the Integrality of n-th Roots of Generating Functions</a>, arXiv:math/0509316 [math.NT], 2005-2006.
%H A010080 N. Heninger, E. M. Rains and N. J. A. Sloane, <a href="https://doi.org/10.1016/j.jcta.2006.03.018">On the Integrality of n-th Roots of Generating Functions</a>, J. Combinatorial Theory, Series A, 113 (2006), 1732-1745.
%H A010080 M. Terada, J. Asatani and T. Koumoto, <a href="http://isec.ec.okayama-u.ac.jp/home/kusaka/wd/index.html">Weight Distribution</a>
%e A010080 W(x,y) = y^16 + 140*y^12*x^4 + 448*y^10*x^6 + 870*y^8*x^8 + 448*y^6*x^10 + 140*y^4*x^12 + x^16.
%t A010080 m:=15; rt=RecurrenceTable[{n*a[n]==Binomial[m, n-1]-a[n-1]-(m-n+2)*a[n-2],
%t A010080 a[0]==1, a[1]==0}, a, {n,0,m}]; Join[{1}, Table[rt[[i]]+rt[[i+1]],{i,2,m,2}],{1}] (* _Georg Fischer_, Jul 16 2020 *)
%Y A010080 Cf. A110832.
%K A010080 nonn,fini,full
%O A010080 0,3
%A A010080 _N. J. A. Sloane_