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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275073 Number of set partitions of [n] such that i-j is a multiple of six for all i,j belonging to the same block. 2
1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 160, 400, 1000, 2500, 6250, 15625, 46875, 140625, 421875, 1265625, 3796875, 11390625, 39487500, 136890000, 474552000, 1645113600, 5703060480, 19770609664, 77181418496, 301304383744, 1176245959616, 4591883265424 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

LINKS

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

Wikipedia, Partition of a set

FORMULA

a(n) = Product_{i=0..5} A000110(floor((n+i)/6)).

EXAMPLE

a(9) = 8: 17|28|39|4|5|6, 17|28|3|4|5|6|9, 17|2|39|4|5|6|8, 17|2|3|4|5|6|8|9, 1|28|39|4|5|6|7, 1|28|3|4|5|6|7|9, 1|2|39|4|5|6|7|8, 1|2|3|4|5|6|7|8|9.

CROSSREFS

Column k=6 of A275069.

Cf. A000110.

Sequence in context: A210543 A006211 A180209 * A264701 A195904 A101333

Adjacent sequences:  A275070 A275071 A275072 * A275074 A275075 A275076

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 February 16 08:26 EST 2019. Contains 320159 sequences. (Running on oeis4.)