login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145514 Number of partitions of n^n into powers of n, also diagonal of A145515 and A196879. 3
1, 1, 4, 23, 1086, 642457, 6188114528, 1226373476385199, 6071277235712979102634, 884267692532264259002637317099, 4362395890943439751990308572939648140812 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

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

FORMULA

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

EXAMPLE

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

MAPLE

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, n): seq (a(n), n=0..13);

CROSSREFS

Cf. A145515, A196879, A007318.

Sequence in context: A130890 A138578 A107765 * A024543 A010294 A169688

Adjacent sequences:  A145511 A145512 A145513 * A145515 A145516 A145517

KEYWORD

nonn

AUTHOR

Alois P. Heinz (heinz(AT)hs-heilbronn.de), Oct 11 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 14:42 EST 2012. Contains 205514 sequences.