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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064985 Number of partitions of n into factorial parts ( 0! allowed ). 3
1, 2, 4, 6, 9, 12, 17, 22, 29, 36, 45, 54, 66, 78, 93, 108, 126, 144, 166, 188, 214, 240, 270, 300, 336, 372, 414, 456, 504, 552, 608, 664, 728, 792, 864, 936, 1018, 1100, 1192, 1284, 1386, 1488, 1602, 1716, 1842, 1968, 2106, 2244, 2397, 2550, 2718, 2886 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

FORMULA

G.f.: 1/(Product_{i=1..infinity} (1-x^(i!)))/(1-x).

EXAMPLE

a(3) = 6 because we can write 3 = 2!+1! = 2!+0! = 1!+1!+1! = 0!+0!+0! = 1!+1!+0! = 1!+0!+0!.

MATHEMATICA

nn=51; CoefficientList[Series[Product[1/(1-x^(i!)), {i, 0, 10}], {x, 0, nn}], x] (* Geoffrey Critzer, Sep 29 2013 *)

CROSSREFS

Cf. A064986.

Sequence in context: A194450 A080556 A229093 * A090631 A001365 A102379

Adjacent sequences:  A064982 A064983 A064984 * A064986 A064987 A064988

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto, Oct 30 2001

EXTENSIONS

More terms from Vladeta Jovovic and Don Reble (djr(AT)nk.ca), Nov 02 2001

STATUS

approved

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

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

Last modified July 24 04:38 EDT 2014. Contains 244875 sequences.