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!)
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

%I #6 Jul 15 2016 16:54:31

%S 1,1,1,1,1,1,1,2,4,8,16,32,64,160,400,1000,2500,6250,15625,46875,

%T 140625,421875,1265625,3796875,11390625,39487500,136890000,474552000,

%U 1645113600,5703060480,19770609664,77181418496,301304383744,1176245959616,4591883265424

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

%H Alois P. Heinz, <a href="/A275073/b275073.txt">Table of n, a(n) for n = 0..801</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..5} A000110(floor((n+i)/6)).

%e 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.

%Y Column k=6 of A275069.

%Y Cf. A000110.

%K nonn

%O 0,8

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)