[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A238636 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A238636 Number of partitions of 9^n into parts that are at most 9.
(history; published version)
#3 by Alois P. Heinz at Sat Mar 01 19:34:25 EST 2014
STATUS

editing

approved

#2 by Alois P. Heinz at Sat Mar 01 18:56:22 EST 2014
NAME

allocated for Alois P. Heinz

Number of partitions of 9^n into parts that are at most 9.

DATA

1, 30, 845105, 6944433285769, 241192889005578902877, 10133053906998476170548376403, 435014756168760380909523387186194290, 18720322073127387624828552135278902045913865, 805821524592736878546553406787954567208757510893718

OFFSET

0,2

FORMULA

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

CROSSREFS

Row n=9 of A238016.

KEYWORD

allocated

nonn

AUTHOR

Alois P. Heinz, Mar 01 2014

STATUS

approved

editing

#1 by Alois P. Heinz at Sat Mar 01 17:49:28 EST 2014
NAME

allocated for Alois P. Heinz

KEYWORD

allocated

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 19:27 EDT 2024. Contains 375545 sequences. (Running on oeis4.)