A111827 -id:A111827 - cp's OEIS frontend

A145515 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of k^n into powers of k.

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 4, 1, 1, 1, 2, 5, 10, 1, 1, 1, 2, 6, 23, 36, 1, 1, 1, 2, 7, 46, 239, 202, 1, 1, 1, 2, 8, 82, 1086, 5828, 1828, 1, 1, 1, 2, 9, 134, 3707, 79326, 342383, 27338, 1, 1, 1, 2, 10, 205, 10340, 642457, 18583582, 50110484, 692004, 1, 1, 1, 2, 11, 298, 24901, 3649346, 446020582, 14481808030, 18757984046, 30251722, 1, 1

Offset: 0

Alois P. Heinz, Oct 11 2008

			A(2,3) = 5, because there are 5 partitions of 3^2=9 into powers of 3: [1,1,1,1,1,1,1,1,1], [1,1,1,1,1,1,3], [1,1,1,3,3], [3,3,3], [9].
Square array A(n,k) begins:
  1,  1,   1,    1,     1,      1,  ...
  1,  1,   2,    2,     2,      2,  ...
  1,  1,   4,    5,     6,      7,  ...
  1,  1,  10,   23,    46,     82,  ...
  1,  1,  36,  239,  1086,   3707,  ...
  1,  1, 202, 5828, 79326, 642457,  ...

Alois P. Heinz, Antidiagonals n = 0..40, flattened

Columns k=0+1, 2-10 give: A000012, A002577, A078125, A078537, A111822, A111827, A111832, A111837, A145512, A145513.
Row n=3 gives: A189890(k+1).
Main diagonal gives: A145514.
Cf. A007318.

b:= proc(n, j, k) local nn;
      nn:= n+1;
      if n<0  then 0
    elif j=0  or n=0 or k<=1 then 1
    elif j=1  then nn
    elif n>=j then (nn-j) *binomial(nn, j) *add(binomial(j, h)
                   /(nn-j+h) *b(j-h-1, j, k) *(-1)^h, h=0..j-1)
              else b(n, j, k):= b(n-1, j, k) +b(k*n, j-1, k)
      fi
    end:
A:= (n, k)-> b(1, n, k):
seq(seq(A(n, d-n), n=0..d), d=0..13);

b[n_, j_, k_] := Module[{nn = n+1}, Which[n < 0, 0, j == 0 || n == 0 || k <= 1, 1, j == 1, nn, n >= j, (nn-j)*Binomial[nn, j]*Sum[Binomial[j, h]/(nn-j+h)* b[j-h-1, j, k]*(-1)^h, {h, 0, j-1}], True, b[n, j, k] = b[n-1, j, k] + b[k*n, j-1, k] ] ]; a[n_, k_] := b[1, n, k]; Table[Table[a[n, d-n], {n, 0, d}], {d, 0, 13}] // Flatten (* Jean-François Alcover, Dec 12 2013, translated from Maple *)

See program.

For k>1: A(n,k) = [x^(k^n)] 1/Product_{j>=0} (1-x^(k^j)).

Edited by Alois P. Heinz, Jan 12 2011

A111825 Triangle P, read by rows, that satisfies [P^6](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(6*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(0,k)=1 and P(k,k)=1 for all k>=0.

Original entry on oeis.org

1, 1, 1, 1, 6, 1, 1, 96, 36, 1, 1, 6306, 3816, 216, 1, 1, 1883076, 1625436, 139536, 1296, 1, 1, 2700393702, 3121837776, 360839016, 5036256, 7776, 1, 1, 19324893252552, 28794284803908, 4200503990976, 78293629296, 181382976, 46656, 1

Offset: 0

Gottfried Helms and Paul D. Hanna, Aug 22 2005

Also P(n,k) = the partitions of (6^n - 6^(n-k)) into powers of 6 <= 6^(n-k).

			Let q=6; the g.f. of column k of matrix power P^m is:
1 + (m*q^k)*L(x) + (m*q^k)^2/2!*L(x)*L(q*x) +
(m*q^k)^3/3!*L(x)*L(q*x)*L(q^2*x) +
(m*q^k)^4/4!*L(x)*L(q*x)*L(q^2*x)*L(q^3*x) + ...
where L(x) satisfies:
x/(1-x) = L(x) + L(x)*L(q*x)/2! + L(x)*L(q*x)*L(q^2*x)/3! + ...
and L(x) = x - 4/2!*x^2 + 42/3!*x^3 + 7296/4!*x^4 +... (A111829).
Thus the g.f. of column 0 of matrix power P^m is:
1 + m*L(x) + m^2/2!*L(x)*L(6*x) + m^3/3!*L(x)*L(6*x)*L(6^2*x) +
m^4/4!*L(x)*L(6*x)*L(6^2*x)*L(6^3*x) + ...
Triangle P begins:
1;
1,1;
1,6,1;
1,96,36,1;
1,6306,3816,216,1;
1,1883076,1625436,139536,1296,1;
1,2700393702,3121837776,360839016,5036256,7776,1; ...
where P^6 shifts columns left and up one place:
1;
6,1;
96,36,1;
6306,3816,216,1; ...

Cf. A111826 (column 1), A111827 (row sums), A111828 (matrix log); triangles: A110503 (q=-1), A078121 (q=2), A078122 (q=3), A078536 (q=4), A111820 (q=5), A111830 (q=7), A111835 (q=8).

PARI
```
P(n,k,q=6)=local(A=Mat(1),B);if(n
				
```

Let q=6; the g.f. of column k of P^m (ignoring leading zeros) equals: 1 + Sum_{n>=1} (m*q^k)^n/n! * Product_{j=0..n-1} L(q^j*x) where L(x) satisfies: x/(1-x) = Sum_{n>=1} Product_{j=0..n-1} L(q^j*x)/(j+1) and L(x) equals the g.f. of column 0 of the matrix log of P (A111829).

A111822 Number of partitions of 5^n into powers of 5, also equals the row sums of triangle A111820, which shifts columns left and up under matrix 5th power.

Original entry on oeis.org

1, 2, 7, 82, 3707, 642457, 446020582, 1288155051832, 15905066118254957, 856874264098480364332, 204616369654716156089739332, 219286214391142987407272329973707, 1065403165201779499307991460987124895582, 23663347632778954225192551079067428619449114332

Offset: 0

Gottfried Helms and Paul D. Hanna, Aug 22 2005

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..55

Cf. A111820, A002577 (q=2), A078125 (q=3), A078537 (q=4), A111827 (q=6), A111832 (q=7), A111837 (q=8).

Column k=5 of A145515.

a(n,q=5)=local(A=Mat(1),B);if(n<0,0, for(m=1,n+2,B=matrix(m,m);for(i=1,m, for(j=1,i, if(j==i || j==1,B[i,j]=1,B[i,j]=(A^q)[i-1,j-1]);));A=B); return(sum(k=0,n,A[n+1,k+1])))

a(n) = [x^(5^n)] 1/Product_{j>=0}(1-x^(5^j)).

A111832 Number of partitions of 7^n into powers of 7, also equals the row sums of triangle A111830, which shifts columns left and up under matrix 7th power.

Original entry on oeis.org

1, 2, 9, 205, 24901, 16077987, 58169810617, 1226373476385199, 154912862345527456431, 119679779055077323244243580, 574461679441277269788798742908435, 17346328772332966415272910459727649244337, 3328366331331467859745524303574824288197338547909

Offset: 0

Gottfried Helms and Paul D. Hanna, Aug 22 2005

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..28

Cf. A111830, A002577 (q=2), A078125 (q=3), A078537 (q=4), A111822 (q=5), A111827 (q=6), A111837 (q=8). Column 7 of A145515.

a(n,q=7)=local(A=Mat(1),B);if(n<0,0, for(m=1,n+2,B=matrix(m,m);for(i=1,m, for(j=1,i, if(j==i || j==1,B[i,j]=1,B[i,j]=(A^q)[i-1,j-1]);));A=B); return(sum(k=0,n,A[n+1,k+1])))

a(n) = [x^(7^n)] 1/Product_{j>=0}(1-x^(7^j)).

A111837 Number of partitions of 8^n into powers of 8, also equals the row sums of triangle A111835, which shifts columns left and up under matrix 8th power.

Original entry on oeis.org

1, 2, 10, 298, 53674, 58573738, 409251498922, 19046062579215274, 6071277235712979102634, 13531779463193107731083553706, 214224474679766323250278564215516074, 24390479071277895100812271376578637910371242, 20173309182842708837666031701435147789403500172143530

Offset: 0

Gottfried Helms and Paul D. Hanna, Aug 22 2005

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..45

Cf. A111835, A002577 (q=2), A078125 (q=3), A078537 (q=4), A111822 (q=5), A111827 (q=6), A111832 (q=7). Column 8 of A145515.

a(n,q=8)=local(A=Mat(1),B);if(n<0,0, for(m=1,n+2,B=matrix(m,m);for(i=1,m, for(j=1,i, if(j==i || j==1,B[i,j]=1,B[i,j]=(A^q)[i-1,j-1]);));A=B); return(sum(k=0,n,A[n+1,k+1])))

a(n) = [x^(8^n)] 1/Product_{j>=0} (1-x^(8^j)).

cp's OEIS Frontend

A145515 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of k^n into powers of k.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A111825 Triangle P, read by rows, that satisfies [P^6](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(6*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(0,k)=1 and P(k,k)=1 for all k>=0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

A111822 Number of partitions of 5^n into powers of 5, also equals the row sums of triangle A111820, which shifts columns left and up under matrix 5th power.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A111832 Number of partitions of 7^n into powers of 7, also equals the row sums of triangle A111830, which shifts columns left and up under matrix 7th power.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A111837 Number of partitions of 8^n into powers of 8, also equals the row sums of triangle A111835, which shifts columns left and up under matrix 8th power.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula