A078125 -id:A078125 - cp's OEIS frontend

A002577 Number of partitions of 2^n into powers of 2.

1, 2, 4, 10, 36, 202, 1828, 27338, 692004, 30251722, 2320518948, 316359580362, 77477180493604, 34394869942983370, 27893897106768940836, 41603705003444309596874, 114788185359199234852802340, 588880400923055731115178072778, 5642645813427132737155703265972004

Offset: 0

N. J. A. Sloane

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 numbers from the second row of T, computed for given m and n > 2, are the (m+2)-gonal numbers. So the second row contains the first members of: A000290 (the square numbers) when m=2, A000326 (the pentagonal numbers) when m=3, and so on. But rows IV, V etc. of the given table are not represented in the OEIS till now. - Valentin Bakoev, Feb 25 2009; edited by M. F. Hasler, Feb 09 2014

			To compute t_2(6,1) we can use a table T, defined as T[i,j]= t_2(i,j), for i=1,2,...,6(=n), and j= 0,1,2,...,32(= k*m^{n-1}). It is: 1,2,3,4,5,6,7,8,9...,33; 1,4,9,16,25,36,49...,81; (so the second row contains the first members of A000290 -- the square numbers) 1,10,35,84,165,...,969; (so the third row contains the first members of A000447. The r-th tetrahedral number is given by formula r(r+1)(r+2)/6. This row (also A000447) contains the tetrahedral numbers, obtained for r=1,3,5,7,...) 1,36,201,656,1625; 1,202,1827; 1,1828; Column 1 contains the first 6 members of A002577. - _Valentin Bakoev_, Feb 25 2009
G.f. = 1 + 2*x + 4*x^2 + 10*x^3 + 36*x^4 + 202*x^5 + 1828*x^6 + ...

R. F. Churchhouse, Binary partitions, pp. 397-400 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.
Lawrence, Jim. "Dual-Antiprisms and Partitions of Powers of 2 into Powers of 2." Discrete & Computational Geometry, Vol. 16 (2019): 465-478. See page 466.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..85
V. Bakoev, Algorithmic approach to counting of certain types m-ary partitions, Discrete Mathematics, 275 (2004) pp.17-41.
C. Banderier, H.-K. Hwang, V. Ravelomanana and V. Zacharovas, Analysis of an exhaustive search algorithm in random graphs and the n^{c logn}-asymptotics, 2012. - From _N. J. A. Sloane_, Dec 23 2012
G. Blom and C.-E. Froeberg, Om myntvaexling, (On money-changing) [ Swedish ], Nordisk Matematisk Tidskrift, 10 (1962), 55-69, 103.
G. Blom and C.-E. Froeberg, Om myntvaexling (On money-changing) [Swedish], Nordisk Matematisk Tidskrift, 10 (1962), 55-69, 103. [Annotated scanned copy]
R. F. Churchhouse, Congruence properties of the binary partition function, Math. Proc. Cambr. Phil. Soc. vol 66, no. 2 (1969), 365-370.
Carl-Erik Froberg, Accurate estimation of the number of binary partitions, BIT Numerical Mathematics vol. 17, no 4 (1977) 386-391.
C.-E. Froberg, Accurate estimation of the number of binary partitions [Annotated scanned copy]
H. Minc, The free commutative entropic logarithmetic, Proc. Roy. Soc. Edinburgh Sect. A 65 1959 177-192 (1959).

a(n) = A000123(2^(n-1)) = A018818(2^n).
Cf. A078537, A078121, A000290, A000447.
Column k=2 of A145515, diagonal of A152977. - Alois P. Heinz, Mar 25 2012
See also A002575, A002576.
A column of A125790.
Cf. A000079, A078125, A145513.

import Data.MemoCombinators (memo2, list, integral)
a002577 n = a002577_list !! n
a002577_list = f [1] where
   f xs = (p' xs $ last xs) : f (1 : map (* 2) 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

A002577 := proc(n) if n<=1 then n+1 else A000123(2^(n-1)); fi; end;

$RecursionLimit = 10^5; (* b = A000123 *) b[0] = 1; b[n_?EvenQ] := b[n] = b[n-1] + b[n/2]; b[n_?OddQ] := b[n] = b[n-1] + b[(n-1)/2]; a[n_] := b[2^(n-1)]; a[0] = 1; Table[a[n], {n, 0, 17}] (* Jean-François Alcover, Nov 23 2011 *)
a[ n_] := SeriesCoefficient[ 1 / Product[ 1 - x^2^k, {k, 0, n}], {x, 0, 2^n}]; (* Michael Somos, Apr 21 2014 *)

a(n)=polcoeff(prod(j=0,n,1/(1-x^(2^j)+x*O(x^(2^n)))),2^n) \\ Paul D. Hanna

a(n) is about 0.9233*Sum_j {i=0, 1, 2, 3, ...} 2^(j*(2n-j-1)/2)/j!. - Henry Bottomley, Jul 23 2003
a(n) = A078121(n+1, 1). - Paul D. Hanna, Sep 13 2004
A002577(n)-1 = A125792(n). - Let m > 1, n > 0 and k >= 0. The general formula for the number of all partitions of k*m^n into powers of m is t_m(n, k)= k+1 if n=1, t_m(n, k)= 1 if k=0, and t_m(n, k)= t_m(n, k-1) + t_m(n-1, k*m) if n > 1 and k > 0. A002577 is obtained for m=2 and n=1,2,3,... - Valentin Bakoev, Feb 25 2009
a(n) = [x^(2^n)] 1/Product_{j>=0} (1-x^(2^j)). - Alois P. Heinz, Sep 27 2011

Edited by M. F. Hasler, Feb 09 2014

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.

Original entry on oeis.org

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

A078122 Infinite lower triangular matrix, M, that satisfies [M^3](i,j) = M(i+1,j+1) for all i,j>=0 where [M^n](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 12, 9, 1, 1, 93, 117, 27, 1, 1, 1632, 3033, 1080, 81, 1, 1, 68457, 177507, 86373, 9801, 243, 1, 1, 7112055, 24975171, 15562314, 2371761, 88452, 729, 1, 1, 1879090014, 8786827629, 6734916423, 1291958181, 64392813, 796797, 2187, 1

Offset: 0

Paul D. Hanna, Nov 18 2002

M also satisfies: [M^(3k)](i,j) = [M^k](i+1,j+1) for all i,j,k >=0; thus [M^(3^n)](i,j) = M(i+n,j+n) for all n >= 0.

Conjecture: the sum of the n-th row equals the number of partitions of 3^n into powers of 3 (A078125).

			The cube of the matrix is the same matrix excluding the first row and column:
  [1, 0, 0, 0]^3 = [ 1,  0, 0, 0]
  [1, 1, 0, 0]     [ 3,  1, 0, 0]
  [1, 3, 1, 0]     [12,  9, 1, 0]
  [1,12, 9, 1]     [93,117,27, 1]

Alois P. Heinz, Rows n = 0..60, flattened

Cf. A078121, A078123, A078124, A078125, A016142.

S:= proc(i, j) option remember;
       add(M(i, k)*M(k, j), k=0..i)
    end:
M:= proc(i, j) option remember; `if`(j=0 or i=j, 1,
       add(S(i-1, k)*M(k, j-1), k=0..i-1))
    end:
seq(seq(M(n,k), k=0..n), n=0..10);  # Alois P. Heinz, Feb 27 2015

m[i_, j_] := m[i, j]=If[j==0||i==j, 1, m3[i-1, j-1]]; m2[i_, j_] := m2[i, j]=Sum[m[i, k]m[k, j], {k, j, i}]; m3[i_, j_] := m3[i, j]=Sum[m[i, k]m2[k, j], {k, j, i}]; Flatten[Table[m[i, j], {i, 0, 8}, {j, 0, i}]]

M(1, j) = A078124(j), M(j+1, j)=3^j, M(j+2, j) = A016142(j).

M(n, k) = the coefficient of x^(3^n - 3^(n-k)) in the power series expansion of 1/Product_{j=0..n-k}(1-x^(3^j)) whenever 0<=k0 (conjecture).

A078124 Second column, M(n+1,1) for n>=0, of infinite lower triangular matrix M defined in A078122.

Original entry on oeis.org

1, 3, 12, 93, 1632, 68457, 7112055, 1879090014, 1287814075131, 2325758241901161, 11213788533232011006, 145939965725683888932081, 5174322925070232320838406581, 503750821963423009552527526376232

Offset: 0

Paul D. Hanna, Nov 18 2002

nonn

			a(1)=3 since the coefficient of x^6 in 1/Product_{j=0..inf}(1-x^(3^j)) = 1 + x + x^2 + 2x^3 + 2x^4 + 2x^5 + 3x^6 + ... is 3.

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

Cf. A078121, A078122 (matrix shift when cubed), A078123, A078125.

m[i_, j_] := m[i, j]=If[j==0||i==j, 1, m3[i-1, j-1]]; m2[i_, j_] := m2[i, j]=Sum[m[i, k]m[k, j], {k, j, i}]; m3[i_, j_] := m3[i, j]=Sum[m[i, k]m2[k, j], {k, j, i}]; a[n_] := m[n+1, 1]

The partitions of 2*3^n into powers of 3, or, the coefficient of x^(2*3^n) in 1/Product_{j=0..inf}(1-x^(3^j)) (conjecture).

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

Original entry on oeis.org

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

A125800 Rectangular table where column k equals row sums of matrix power A078122^k, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 5, 3, 1, 1, 23, 12, 4, 1, 1, 239, 93, 22, 5, 1, 1, 5828, 1632, 238, 35, 6, 1, 1, 342383, 68457, 5827, 485, 51, 7, 1, 1, 50110484, 7112055, 342382, 15200, 861, 70, 8, 1, 1, 18757984046, 1879090014, 50110483, 1144664, 32856, 1393, 92, 9, 1

Offset: 0

Paul D. Hanna, Dec 10 2006

Determinant of n X n upper left submatrix is 3^(n*(n-1)*(n-2)/6).
This table is related to partitions of numbers into powers of 3 (see A078122).
Triangle A078122 shifts left one column under matrix cube.
Column 1 is A078125, which equals row sums of A078122;
column 2 is A078124, which equals row sums of A078122^2.

			Recurrence T(n,k) = T(n,k-1) + T(n-1,3*k) is illustrated by:
  T(3,3) = T(3,2) + T(2,9) = 93 + 145 = 238;
  T(4,3) = T(4,2) + T(3,9) = 1632 + 4195 = 5827;
  T(5,3) = T(5,2) + T(4,9) = 68457 + 273925 = 342382.
Rows of this table begin:
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...;
  1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, ...;
  1, 5, 12, 22, 35, 51, 70, 92, 117, 145, 176, 210, ...;
  1, 23, 93, 238, 485, 861, 1393, 2108, 3033, 4195, 5621, ...;
  1, 239, 1632, 5827, 15200, 32856, 62629, 109082, 177507, 273925,...;
  1, 5828, 68457, 342382, 1144664, 3013980, 6769672, 13570796, ...;
  1, 342383, 7112055, 50110483, 215155493, 690729981, 1828979530, ...;
  1, 50110484, 1879090014, 18757984045, 103674882878, 406279238154,..;
  1, 18757984046, 1287814075131, 18318289003447, 130648799730635, ...;
Triangle A078122 begins:
  1;
  1,     1;
  1,     3,      1;
  1,    12,      9,     1;
  1,    93,    117,    27,    1;
  1,  1632,   3033,  1080,   81,   1;
  1, 68457, 177507, 86373, 9801, 243, 1; ...
where row sums form column 1 of this table A125790,
and column k of A078122 equals column 3^k - 1 of this table A125800.
Matrix square A078122^2 begins:
     1;
     2,     1;
     5,     6,     1;
    23,    51,    18,    1;
   239,   861,   477,   54,   1;
  5828, 32856, 25263, 4347, 162, 1; ...
where row sums form column 2 of this table A125790,
and column 0 of A078122^2 forms column 1 of this table A125790.

Robert Israel, Table of n, a(n) for n = 0..2484 (antidiagonals 0 to 69, flattened)

Cf. A078122; columns: A078125, A078124, A125801, A125802, A125803; A125804 (diagonal), A125805 (antidiagonal sums); related table: A125800 (q=2).

f[0]:= 1/(1-z):
S[0]:= series(f[0],z,21):
for n from 1 to 20 do
  ff:= unapply(f[n-1],z);
  f[n]:= simplify(1/3*sum(ff(w*z^(1/3)),w=RootOf(Z^3-1,Z)))/(1-z);
  S[n]:= series(f[n],z,21-n)
od:
seq(seq(coeff(S[s-i],z,i),i=0..s),s=0..20); # Robert Israel, Jun 02 2019

T[0, ] = T[, 0] = 1; T[n_, k_] := T[n, k] = T[n, k-1] + T[n-1, 3 k]; Table[T[n-k, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jan 08 2016 *)

T(n,k,p=0,q=3)=local(A=Mat(1), B); if(n

T(n,k) = T(n,k-1) + T(n-1,3*k) for n > 0, k > 0, with T(0,n)=T(n,0)=1 for n >= 0.

G.f. of row n is g_n(z) where g_{n+1}(z) = (1-z)^(-1)*Sum_{w^3=1} g_n(w*z^(1/3)) (the sum being over the cube roots of unity). - Robert Israel, Jun 02 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)).

cp's OEIS Frontend

A002577 Number of partitions of 2^n into powers of 2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

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

A078122 Infinite lower triangular matrix, M, that satisfies [M^3](i,j) = M(i+1,j+1) for all i,j>=0 where [M^n](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A078124 Second column, M(n+1,1) for n>=0, of infinite lower triangular matrix M defined in A078122.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

A125800 Rectangular table where column k equals row sums of matrix power A078122^k, read by antidiagonals.

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