A145515 -id:A145515 - cp's OEIS frontend

A078537 Number of partitions of 4^n into powers of 4 (without regard to order).

1, 2, 6, 46, 1086, 79326, 18583582, 14481808030, 38559135542174, 357934565638890910, 11766678027350761752990, 1387043469046575118555443614, 592264246356176268834689653440926, 923812464024548700407122072128655860126, 5301247577915139769925461060755690116740047262

Offset: 0

Paul D. Hanna, Nov 29 2002

nonn

Conjecture: a(n) = sum of the n-th row of lower triangular matrix A078536.

			a(2) = 6 since partitions of 4^2 into powers of 4 are: [16], [4,4,4,4], [4,4,4,1,1,1,1], [4,4,1,1,1,1,1,1,1,1], [4,1,1,1,1,1,1,1,1,1,1,1,1], [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1].

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

Cf. A002577, A078125, A078536.

Column k=4 of A145515.

a[0] = 1; a[n_] := a[n] = a[n - 1] + a[Floor[n/4]]; b = Table[ a[n], {n, 0, 4^9}]; Table[ b[[4^n + 1]], {n, 0, 9}]

a(n) = coefficient of x^(4^n) in power series expansion of 1/[(1-x)(1-x^4)(1-x^16)...(1-x^(4^k))...].

Extended by Robert G. Wilson v, Dec 01 2002

More terms from Alois P. Heinz, Oct 11 2008

A181322 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2*n into powers of 2 less than or equal to 2^k.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 4, 1, 1, 2, 4, 6, 5, 1, 1, 2, 4, 6, 9, 6, 1, 1, 2, 4, 6, 10, 12, 7, 1, 1, 2, 4, 6, 10, 14, 16, 8, 1, 1, 2, 4, 6, 10, 14, 20, 20, 9, 1, 1, 2, 4, 6, 10, 14, 20, 26, 25, 10, 1, 1, 2, 4, 6, 10, 14, 20, 26, 35, 30, 11, 1, 1, 2, 4, 6, 10, 14, 20, 26, 36, 44, 36, 12, 1, 1, 2, 4, 6, 10, 14, 20, 26, 36, 46, 56, 42, 13, 1

Offset: 0

Alois P. Heinz, Jan 26 2011

Column sequences converge towards A000123.

			A(3,2) = 6, because there are 6 partitions of 2*3=6 into powers of 2 less than or equal to 2^2=4: [4,2], [4,1,1], [2,2,2], [2,2,1,1], [2,1,1,1,1], [1,1,1,1,1,1].
Square array A(n,k) begins:
  1,  1,  1,  1,  1,  1,  ...
  1,  2,  2,  2,  2,  2,  ...
  1,  3,  4,  4,  4,  4,  ...
  1,  4,  6,  6,  6,  6,  ...
  1,  5,  9, 10, 10, 10,  ...
  1,  6, 12, 14, 14, 14,  ...

Alois P. Heinz, Antidiagonals n = 0..140, flattened
G. Blom and C.-E. Froeberg, Om myntvaexling (On money-changing) [Swedish], Nordisk Matematisk Tidskrift, 10 (1962), 55-69, 103. [Annotated scanned copy] See Table 4.

Columns k=0-5 give: A000012, A000027(n+1), A002620(n+2), A008804, A088932, A088954.
Main diagonal gives A000123.
Cf. A145515.
See A262553 for another version of this array.
See A072170 for a related array (having the same limiting column).

b:= proc(n, j) local nn, r;
      if n<0 then 0
    elif j=0 then 1
    elif j=1 then n+1
    elif n b(n/2^(k-1), k):
seq(seq(A(n, d-n), n=0..d), d=0..13);

b[n_, j_] := b[n, j] = Module[{nn, r}, Which[n<0, 0, j == 0, 1, j == 1, n+1, nJean-François Alcover, Jan 15 2014, translated from Maple *)

A181322(n,k,r=1)={if(nA181322(n-1,k,0)+A181322(2*n,k-1,0),n-=r=1+n\1,(r-k)*binomial(r,k)*sum(i=0,min(k-1,k+n), binomial(k,i)/(r-k+i)*A181322(k-i+n,k,0) *(-1)^i))} \\ From Maple. - M. F. Hasler, Feb 19 2019

G.f. of column k: 1/(1-x) * 1/Product_{j=0..k-1} (1 - x^(2^j)).
A(n,k) = Sum_{i=0..k} A089177(n,i).
For n < 2^k, T(n,k) = A000123(k). T(n,0) = 1, T(n,1) = n+1. - M. F. Hasler, Feb 19 2019

A125801 Column 3 of table A125800; also equals row sums of matrix power A078122^3.

Original entry on oeis.org

1, 4, 22, 238, 5827, 342382, 50110483, 18757984045, 18318289003447, 47398244089264546, 329030840161393127680, 6190927493941741957366099, 318447442589056401640929570895, 45106654667152833836835578059359838

Offset: 0

Paul D. Hanna, Dec 10 2006

nonn

Triangle A078122 shifts left one column under matrix cube and is related to partitions into powers of 3.

Number of partitions of 3^n into powers of 3, excluding the trivial partition 3^n=3^n. - Valentin Bakoev, Feb 20 2009

			To obtain t_3(5,1) we use the table T, defined as T(i,j) = t_3(i,j), for i=1,2,...,5(=n), and j=0,1,2,...,81(= k*m^{n-1}). It is 1,1,1,1,1,1,...1; 1,4,7,10,13,...,82; 1,22,70,145,247,376,532,715,925,1162; 1,238,1393,4195; 1,5827; Column 1 contains the first 5 terms of A125801. - _Valentin Bakoev_, Feb 20 2009

Alois P. Heinz, Table of n, a(n) for n = 0..40
V. Bakoev, Algorithmic approach to counting of certain types m-ary partitions, Discrete Mathematics, 275 (2004) pp. 17-41.

Cf. A125800, A078122; other columns: A078125, A078124, A125802, A125803.

g:= proc(b, n, k) option remember; local t; if b<0 then 0 elif b=0 or n=0 or k<=1 then 1 elif b>=n then add (g(b-t, n, k) *binomial (n+1, t) *(-1)^(t+1), t=1..n+1); else g(b-1, n, k) +g(b*k, n-1, k) fi end: a:= n-> g(1, n+1,3)-1: seq(a(n), n=0..25); # Alois P. Heinz, Feb 27 2009

T[0, ] = T[, 0] = 1; T[n_, k_] := T[n, k] = T[n, k-1] + T[n-1, 3 k];
a[n_] := T[n, 3]; Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 15}] (* Jean-François Alcover, Jan 21 2017 *)

a(n)=local(p=3,q=3,A=Mat(1), B); for(m=1, n+1, 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(c=0,n,(A^p)[n+1,c+1]))

Denote the sum: m^n  +m^n + ... + m^n, k times, by k*m^n (m > 1, n > 0 and k are positive integers). The general formula for the number of all partitions of the sum k*m^n into powers of m smaller than m^n, is t_m(n, k)= 1 when n=1 or k=0, or = t_m(n, k-1) + Sum_{j=1..m} t_m(n-1, (k-1)*n+j)}, when n > 1 and k > 0. A125801 is obtained for m=3 and n=1,2,3,... - Valentin Bakoev, Feb 20 2009
From Valentin Bakoev, Feb 20 2009: (Start)
Adding 1 to the terms of A125801 we obtain A078125.
For given m, the general formula for t_m(n, k) and the corresponding tables T, computed as in the example, determine a family of related sequences (placed in the rows or in the columns of T). For example, the sequences from the 3rd, 4th, etc. rows of the given table are not represented in the OEIS till now. (End)
a(n) = A145515(n+1,3)-1. - Alois P. Heinz, Feb 27 2009

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)).

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

Original entry on oeis.org

1, 2, 8, 134, 10340, 3649346, 6188114528, 52398157106366, 2277627698797283420, 518758596372421679994170, 628925760908337480420110203736, 4109478867142143642923124190955500214

Offset: 0

Gottfried Helms and Paul D. Hanna, Aug 22 2005

nonn

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

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

a(n,q=6)=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^(6^n)] 1/Product_{j>=0}(1-x^(6^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)).

A145513 Number of partitions of 10^n into powers of 10.

Original entry on oeis.org

1, 2, 12, 562, 195812, 515009562, 10837901390812, 1899421190329234562, 2851206628197445401265812, 37421114946843687272702534859562, 4362395890943439751990308572939648140812, 4573514084633441973328831327010967245403925484562, 43557001521047571730475817291330175020887917015964570015812

Offset: 0

Alois P. Heinz, Oct 11 2008

nonn

a(n) = A179051(10^n); for n>0: a(n) = A179052(10^(n-1)). - Reinhard Zumkeller, Jun 27 2010

			a(1) = 2, because there are 2 partitions of 10^1 into powers of 10: [1,1,1,1,1,1,1,1,1,1], [10].

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

Cf. 10th column of A145515, A007318.

Cf. A011557, A002577, A078125.

import Data.MemoCombinators (memo2, list, integral)
a145513 n = a145513_list !! n
a145513_list = f [1] where
   f xs = (p' xs $ last xs) : f (1 : map (* 10) xs)
   p' = memo2 (list integral) integral p
   p  0 = 1; p []  = 0
   p ks'@(k:ks) m = if m < k then 0 else p' ks' (m - k) + p' ks m
-- Reinhard Zumkeller, Nov 27 2015

g:= proc(b,n,k) option remember; local t; if b<0 then 0 elif b=0 or n=0 or k<=1 then 1 elif b>=n then add(g(b-t, n, k) *binomial(n+1, t) *(-1)^(t+1), t=1..n+1); else g(b-1, n, k) +g(b*k, n-1, k) fi end: a:= n-> g(1,n,10): seq(a(n), n=0..13);

g[b_, n_, k_] := g[b, n, k] = Module[{t}, Which[b < 0, 0, b == 0 || n == 0 || k <= 1, 1, b >= n, Sum[g[b - t, n, k]*Binomial[n + 1, t] *(-1)^(t + 1), {t, 1, n + 1}], True, g[b - 1, n, k] + g[b*k, n - 1, k]]]; a[n_] := g[1, n, 10]; Table[a[n], {n, 0, 13}] (* Jean-François Alcover, Feb 01 2017, after Alois P. Heinz *)

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

A292477 Square array A(n,k), n >= 0, k >= 2, read by antidiagonals: A(n,k) = [x^(k*n)] Product_{j>=0} 1/(1 - x^(k^j)).

Original entry on oeis.org

1, 1, 2, 1, 2, 4, 1, 2, 3, 6, 1, 2, 3, 5, 10, 1, 2, 3, 4, 7, 14, 1, 2, 3, 4, 6, 9, 20, 1, 2, 3, 4, 5, 8, 12, 26, 1, 2, 3, 4, 5, 7, 10, 15, 36, 1, 2, 3, 4, 5, 6, 9, 12, 18, 46, 1, 2, 3, 4, 5, 6, 8, 11, 15, 23, 60, 1, 2, 3, 4, 5, 6, 7, 10, 13, 18, 28, 74, 1, 2, 3, 4, 5, 6, 7, 9, 12, 15, 21, 33, 94

Offset: 0

Ilya Gutkovskiy, Sep 17 2017

A(n,k) is the number of partitions of k*n into powers of k.

			Square array begins:
   1,  1,  1,  1,  1,  1, ...
   2,  2,  2,  2,  2,  2, ...
   4,  3,  3,  3,  3,  3, ...
   6,  5,  4,  4,  4,  4, ...
  10,  7,  6,  5,  5,  5, ...
  14,  9,  8,  7,  6,  6, ...

Seiichi Manyama, Antidiagonals n = 0..139, flattened
George E. Andrews, Aviezri S. Fraenkel, James A. Sellers, Characterizing the number of m-ary partitions modulo m, Amer. Math. Monthly 122:9 (2015), 880-885.
Index entries for related partition-counting sequences

Columns k=2..5 give A000123, A005704, A005705, A005706.
Mirror of A089688 (excluding the first row).
Cf. A145515, A294316.

Table[Function[k, SeriesCoefficient[Product[1/(1 - x^k^i), {i, 0, n}], {x, 0, k n}]][j - n + 2], {j, 0, 12}, {n, 0, j}] // Flatten

A172288 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2^2^n into powers of 2 less than or equal to 2^k.

Original entry on oeis.org

1, 2, 1, 2, 3, 1, 2, 4, 9, 1, 2, 4, 25, 129, 1, 2, 4, 35, 4225, 32769, 1, 2, 4, 36, 47905, 268468225, 2147483649, 1, 2, 4, 36, 222241, 733276217345, 1152921506754330625, 9223372036854775809, 1

Offset: 0

Alois P. Heinz, Jan 26 2011

A(18,18) = 2797884726...4715787265 has 1420371 decimal digits and was computed by the algorithm given below.

			A(2,1) = 9, because there are 9 partitions of 2^2^2=16 into powers of 2 less than or equal to 2^1=2: [2,2,2,2,2,2,2,2], [2,2,2,2,2,2,2,1,1], [2,2,2,2,2,2,1,1,1,1], [2,2,2,2,2,1,1,1,1,1,1], [2,2,2,2,1,1,1,1,1,1,1,1], [2,2,2,1,1,1,1,1,1,1,1,1,1], [2,2,1,1,1,1,1,1,1,1,1,1,1,1], [2,1,1,1,1,1,1,1,1,1,1,1,1,1,1], [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1].
Square array A(n,k) begins:
  1,     2,         2,            2,               2,  ...
  1,     3,         4,            4,               4,  ...
  1,     9,        25,           35,              36,  ...
  1,   129,      4225,        47905,          222241,  ...
  1, 32769, 268468225, 733276217345, 751333186150401,  ...

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

Cf. A002577, A000123, A181322, A145515.

Main diagonal gives: A182135.

b:= proc(n,j) option remember; local nn, r;
      if n<0 then 0
    elif j=0 then 1
    elif j=1 then n+1
    elif n b(2^(2^n-k), k):
seq(seq(A(n, d-n), n=0..d), d=0..8);

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

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

cp's OEIS Frontend

A078537 Number of partitions of 4^n into powers of 4 (without regard to order).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A181322 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2*n into powers of 2 less than or equal to 2^k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A125801 Column 3 of table A125800; also equals row sums of matrix power A078122^3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

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

A111827 Number of partitions of 6^n into powers of 6, also equals the row sums of triangle A111825, which shifts columns left and up under matrix 6th 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

A145513 Number of partitions of 10^n into powers of 10.

Views

Author

Keywords

Comments