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.

A274573 Column 2 of triangle A274570.

This page as a plain text file.
%I A274573 #8 Jun 24 2017 01:05:41
%S A274573 1,3,39,1125,56505,4354923,476265591,70056231213,13329387478113,
%T A274573 3184105899176739,932720103991595919,328710383679927689157,
%U A274573 137188135970104212440721,66909975066823379752742835,37706189062081696231083478647,24312515006613477431766856702797,17784145956730483348850500758855969,14647274671009402833580157237962722147,13492886769176913829412675003231182928079
%N A274573 Column 2 of triangle A274570.
%C A274573 Triangle A274570 transforms diagonals in the array A274390 of coefficients of successive iterations of Euler's tree function (A000169).
%H A274573 Paul D. Hanna, <a href="/A274573/b274573.txt">Table of n, a(n) for n = 0..38</a>
%o A274573 (PARI) {T(n, k)=local(F=x,
%o A274573 LW=serreverse(x*exp(-x+x*O(x^(n+2)))), M, N, P, m=max(n, k));
%o A274573 M=matrix(m+3, m+3, r, c, F=x; for(i=1, r+c-2, F=subst(F, x, LW)); polcoeff(F, c));
%o A274573 N=matrix(m+1, m+1, r, c, M[r, c]);
%o A274573 P=matrix(m+1, m+1, r, c, M[r+1, c]);
%o A274573 (n-k)!*(P~*N~^-1)[n+1, k+1]}
%o A274573 /* Print triangle A274570: */
%o A274573 for(n=0,10,for(k=0,n,print1(T(n,k),", "));print(""))
%o A274573 /* Print this sequence, which is column 2 */
%o A274573 for(n=0,20,print1(T(n+2,2),", "))
%Y A274573 Cf. A274570, A274571, A274572, A274574.
%K A274573 nonn
%O A274573 0,2
%A A274573 _Paul D. Hanna_, Jun 28 2016