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.

Showing 1-2 of 2 results.

A111553 Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+4 of T), or [T^p](m,0) = p*T(p+m,p+4) for all m>=1 and p>=-4.

Original entry on oeis.org

1, 1, 1, 6, 2, 1, 46, 10, 3, 1, 416, 72, 16, 4, 1, 4256, 632, 116, 24, 5, 1, 48096, 6352, 1016, 184, 34, 6, 1, 591536, 70912, 10176, 1664, 282, 46, 7, 1, 7840576, 864192, 113216, 17024, 2696, 416, 60, 8, 1, 111226816, 11371072, 1375456, 192384, 28792, 4256, 592, 76, 9, 1
Offset: 0

Views

Author

Paul D. Hanna, Aug 07 2005

Keywords

Comments

Column 0 equals A111531 (related to log of factorial series). Column 4 (A111557) equals SHIFT_LEFT(column 0 of log(T)), where the matrix logarithm, log(T), equals the integer matrix A111560.

Examples

			SHIFT_LEFT(column 0 of T^-4) = -4*(column 0 of T);
SHIFT_LEFT(column 0 of T^-3) = -3*(column 1 of T);
SHIFT_LEFT(column 0 of T^-2) = -2*(column 2 of T);
SHIFT_LEFT(column 0 of T^-1) = -1*(column 3 of T);
SHIFT_LEFT(column 0 of log(T)) = column 4 of T;
SHIFT_LEFT(column 0 of T^1) = 1*(column 5 of T);
where SHIFT_LEFT of column sequence shifts 1 place left.
Triangle T begins:
1;
1,1;
6,2,1;
46,10,3,1;
416,72,16,4,1;
4256,632,116,24,5,1;
48096,6352,1016,184,34,6,1;
591536,70912,10176,1664,282,46,7,1;
7840576,864192,113216,17024,2696,416,60,8,1; ...
After initial term, column 3 is 4 times column 0.
Matrix inverse T^-1 = A111559 starts:
1;
-1,1;
-4,-2,1;
-24,-4,-3,1;
-184,-24,-4,-4,1;
-1664,-184,-24,-4,-5,1;
-17024,-1664,-184,-24,-4,-6,1; ...
where columns are all equal after initial terms;
compare columns of T^-1 to column 3 of T.
Matrix logarithm log(T) = A111560 is:
0;
1,0;
5,2,0;
34,7,3,0;
282,44,10,4,0;
2696,354,60,14,5,0;
28792,3328,470,84,19,6,0; ...
compare column 0 of log(T) to column 4 of T.
		

Crossrefs

Cf. A111531 (column 0), A111554 (column 1), A111555 (column 2), A111556 (column 3), A111557 (column 4), A111558 (row sums), A111559 (matrix inverse), A111560 (matrix log); related tables: A111528, A104980, A111536, A111544.

Programs

  • Mathematica
    T[n_, k_] := T[n, k] = If[nJean-François Alcover, Aug 09 2018, from PARI *)
  • PARI
    T(n,k)=if(n
    				

Formula

T(n, k) = k*T(n, k+1) + Sum_{j=0..n-k-1} T(j+3, 3)*T(n, j+k+1) for n>k>0, with T(n, n) = 1, T(n+1, n) = n+1, T(n+4, 3) = 4*T(n+1, 0), T(n+5, 5) = T(n+1, 0), for n>=0.

A111556 Column 3 of triangle A111553.

Original entry on oeis.org

1, 4, 24, 184, 1664, 17024, 192384, 2366144, 31362304, 444907264, 6720628224, 107674883584, 1823884857344, 32575705493504, 612054254936064, 12071987619713024, 249477777420304384, 5392386599983366144
Offset: 0

Views

Author

Paul D. Hanna, Aug 07 2005

Keywords

Comments

Also found in column 0 of triangle A111559, which equals the matrix inverse of A111553.

Crossrefs

Programs

  • PARI
    {a(n)=if(n<0,0,(matrix(n+4,n+4,m,j,if(m==j,1,if(m==j+1,-m+1, -(m-j-1)*polcoeff(log(sum(i=0,m,(i+3)!/3!*x^i)),m-j-1))))^-1)[n+4,4])}

Formula

G.f.: log(Sum_{n>=0} ((n+3)!/3!)*x^n) = Sum_{n>=1} a(n)*x^n/n.
a(n) = 4*A111531(n) for n>0.
From Groux Roland, Dec 10 2010: (Start)
6*a(n+1) = (n+5)! - 4*(n+4)! - Sum_{k=0..n-1} (n-k+3)!*a(k+1).
a(n+1) is the moment of order n for the density 6*x^3*exp(-x)/( (x^3*exp(-x)*Ei(x)-x^2-x-2)^2 + Pi^2*x^6*exp(-2*x) ) over the interval 0..infinity. (End)
a(n) = Sum_{k=0..n} A200659(n,k)*3^k. - Philippe Deléham, Nov 21 2011
G.f.: 1/(1-4x/(1-2x/(1-5x/(1-3x/(1-6x/(1-4x/(1-...(continued fraction). - Philippe Deléham, Nov 21 2011
G.f.: 1/Q(0), where Q(k) = 1 - 2*x + k*x - x*(k+2)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 03 2013
G.f.: 1/x - 3 - 2/(x*G(0)), where G(k) = 1 + 1/(1 - x*(k+4)/(x*(k+4) + 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 06 2013
G.f.: W(0), where W(k) = 1 - x*(k+4)/( x*(k+4) - 1/(1 - x*(k+2)/( x*(k+2) - 1/W(k+1) ))); (continued fraction). - Sergei N. Gladkovskii, Aug 26 2013
Showing 1-2 of 2 results.