login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A275077
Number of set partitions of [n] such that i-j is a multiple of ten for all i,j belonging to the same block.
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2560, 6400, 16000, 40000, 100000, 250000, 625000, 1562500, 3906250, 9765625, 29296875, 87890625, 263671875, 791015625, 2373046875, 7119140625, 21357421875, 64072265625, 192216796875
OFFSET
0,12
LINKS
FORMULA
a(n) = Product_{i=0..9} A000110(floor((n+i)/10)).
CROSSREFS
Column k=10 of A275069.
Cf. A000110.
Sequence in context: A274864 A274863 A138815 * A275065 A367654 A180212
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jul 15 2016
STATUS
approved