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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275076 Number of set partitions of [n] such that i-j is a multiple of nine for all i,j belonging to the same block. 2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1280, 3200, 8000, 20000, 50000, 125000, 312500, 781250, 1953125, 5859375, 17578125, 52734375, 158203125, 474609375, 1423828125, 4271484375, 12814453125, 38443359375, 133270312500, 462003750000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,11

LINKS

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

Wikipedia, Partition of a set

FORMULA

a(n) = Product_{i=0..8} A000110(floor((n+i)/9)).

CROSSREFS

Column k=9 of A275069.

Cf. A000110.

Sequence in context: A275065 A180212 A274862 * A275064 A238938 A103662

Adjacent sequences:  A275073 A275074 A275075 * A275077 A275078 A275079

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jul 15 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 17:14 EST 2019. Contains 329126 sequences. (Running on oeis4.)