The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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

%I

%S 1,1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,512,1280,3200,8000,20000,

%T 50000,125000,312500,781250,1953125,5859375,17578125,52734375,

%U 158203125,474609375,1423828125,4271484375,12814453125,38443359375,133270312500,462003750000

%N Number of set partitions of [n] such that i-j is a multiple of nine for all i,j belonging to the same block.

%H Alois P. Heinz, <a href="/A275076/b275076.txt">Table of n, a(n) for n = 0..871</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>

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

%Y Column k=9 of A275069.

%Y Cf. A000110.

%K nonn

%O 0,11

%A _Alois P. Heinz_, Jul 15 2016

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.

Last modified June 23 04:15 EDT 2021. Contains 345395 sequences. (Running on oeis4.)