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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275075 Number of set partitions of [n] such that i-j is a multiple of eight for all i,j belonging to the same block. 2

%I

%S 1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,640,1600,4000,10000,25000,

%T 62500,156250,390625,1171875,3515625,10546875,31640625,94921875,

%U 284765625,854296875,2562890625,8884687500,30800250000,106774200000,370150560000,1283188608000

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

%H Alois P. Heinz, <a href="/A275075/b275075.txt">Table of n, a(n) for n = 0..850</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..7} A000110(floor((n+i)/8)).

%e a(9) = 2: 19|2|3|4|5|6|7|8, 1|2|3|4|5|6|7|8|9.

%Y Column k=8 of A275069.

%Y Cf. A000110.

%K nonn

%O 0,10

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 17:43 EDT 2021. Contains 345199 sequences. (Running on oeis4.)