cp's OEIS Frontend

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.

A135071 a(n) = [x^(2^n+n-2)] (x + x^2 + x^4 + x^8 + ... + x^(2^n))^n /(n*(n-1)/2) for n>=2.

This page as a plain text file.
%I A135071 #20 Aug 31 2024 23:29:06
%S A135071 1,1,3,7,40,236,1876,9948,147880,1453960,22015900,208197540,
%T A135071 4313645260,50025596492,908013578304,10257540119128,410662921858728,
%U A135071 7157148265575464,196798065310375948,3119117728942974484,117123479632632724204,2164788189493906776364,62917262965957689991564,1107373183582759036993164,59647207431378288643241916,1329593013280581859290571836,48482067282133360326936987936
%N A135071 a(n) = [x^(2^n+n-2)] (x + x^2 + x^4 + x^8 + ... + x^(2^n))^n /(n*(n-1)/2) for n>=2.
%F A135071 a(n) = A135070(n) / (n(n-1)/2) for n>=2.
%t A135071 f[x_, n_] := (1/Binomial[n, 2])*(Sum[x^(2^k), {k, 0, n}])^n; Table[Coefficient[f[x, n], x^(2^n + n - 2)] , {n, 2, 10}] (* _G. C. Greubel_, Sep 22 2016 *)
%o A135071 (PARI) {a(n)=if(n<2,0,polcoeff(sum(j=0,n,x^(2^j)+O(x^(2^n+n)))^n,2^n+n-2)/(n*(n-1)/2))}
%Y A135071 Cf. A135068, A135069, A135070.
%K A135071 nonn
%O A135071 2,3
%A A135071 _Paul D. Hanna_, Nov 17 2007
%E A135071 a(15)-a(19) from _Alois P. Heinz_, Apr 29 2009
%E A135071 a(20)-a(21) from _Max Alekseyev_, Jul 25 2009
%E A135071 a(22)-a(28) from _Max Alekseyev_, Aug 31 2024