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 A122192 #12 Jul 12 2021 02:40:46 %S A122192 6,0,-1518,-7728,1149126,9775920,-851127150,-10374206304,619950551814, %T A122192 10059106207584,-443172509029998,-9223980220220304,309985135145332422, %U A122192 8134978519171135632,-211181377213616588526,-6965969413257227260608,139095682365347347024902 %N A122192 Sum of the n-th powers of the roots of the (reduced) weight enumerator of the extended Golay code (1 + 759*x^2 + 2576*x^3 + 759*x^4 + x^6). %H A122192 G. C. Greubel, <a href="/A122192/b122192.txt">Table of n, a(n) for n = 0..500</a> %H A122192 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,-759,-2576,-759,0,-1). %F A122192 G.f.: 6*(1 + 506*x^2 + 1288*x^3 + 253*x^4)/(1 + 759*x^2 + 2576*x^3 + 759*x^4 + x^6). %p A122192 Newt:=proc(f) local t1,t2,t3,t4; t1:=f; t2:=diff(f,x); t3:=expand(x^degree(t1,x)*subs(x=1/x,t1)); t4:=expand(x^degree(t2,x)*subs(x=1/x,t2)); factor(t4/t3); end; %p A122192 g:=1+759*x^2+2576*x^3+759*x^4+x^6; Newt(g); series(%,x,60); %t A122192 LinearRecurrence[{0,-759,-2576,-759,0,-1}, {6,0,-1518,-7728,1149126,9775920}, 30] (* _G. C. Greubel_, Jul 11 2021 *) %o A122192 (PARI) polsym(x^6 + 759*x^4 + 2576*x^3 + 759*x^2 + 1, 30) \\ _Charles R Greathouse IV_, Jul 20 2016 %o A122192 (Sage) %o A122192 def A122192_list(prec): %o A122192 P.<x> = PowerSeriesRing(ZZ, prec) %o A122192 return P( 6*(1+506*x^2+1288*x^3+253*x^4)/(1+759*x^2+2576*x^3+759*x^4 +x^6) ).list() %o A122192 A122192_list(30) # _G. C. Greubel_, Jul 11 2021 %Y A122192 Cf. A001380, A123013. %K A122192 sign,easy %O A122192 0,1 %A A122192 _N. J. A. Sloane_, Nov 12 2006