Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064985
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064985 Number of partitions of n into factorial parts ( 0! allowed ). +0
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; listen)
OFFSET

0,2

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

CROSSREFS

Cf. A064986.

Adjacent sequences: A064982 A064983 A064984 this_sequence A064986 A064987 A064988

Sequence in context: A090178 A080548 A080556 this_sequence A090631 A001365 A102379

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Oct 30 2001

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research