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 A029828 #17 Feb 26 2018 09:14:00
%S A029828 691,65520,134250480,11606736960,274945048560,3199218815520,
%T A029828 23782204031040,129554448266880,563087459516400,2056098632318640,
%U A029828 6555199353000480,18693620658498240,48705965462306880,117422349017369760,265457064498837120,566735214731736960,1153203117089652720
%N A029828 Eisenstein series E_12(q) (alternate convention E_6(q)), multiplied by 691.
%D A029828 R. C. Gunning, Lectures on Modular Forms. Princeton Univ. Press, Princeton, NJ, 1962, p. 53.
%D A029828 N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, 1984, see p. 111.
%D A029828 J.-P. Serre, Course in Arithmetic, Chap. VII, Section 4.
%H A029828 Seiichi Manyama, <a href="/A029828/b029828.txt">Table of n, a(n) for n = 0..10000</a>
%H A029828 <a href="/index/Ed#Eisen">Index entries for sequences related to Eisenstein series</a>
%p A029828 E := proc(k) local n,t1; t1 := 1-(2*k/bernoulli(k))*add(sigma[k-1](n)*q^n,n=1..60); series(t1,q,60); end; E(12);
%t A029828 Table[If[n == 0, 691, 65520 DivisorSigma[11, n]], {n, 0, 16}] (* _Jean-François Alcover_, Feb 26 2018 *)
%o A029828 (PARI) a(n)=if(n<1,691*(n==0),65520*sigma(n,11))
%Y A029828 Cf. A037164.
%Y A029828 Cf. A006352 (E_2), A004009 (E_4), A013973 (E_6), A008410 (E_8), A013974 (E_10), A029828 (E_12), A058550 (E_14), A029829 (E_16), A029830 (E_20), A029831 (E_24).
%K A029828 nonn
%O A029828 0,1
%A A029828 _N. J. A. Sloane_