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!)
 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
 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 640, 1600, 4000, 10000, 25000, 62500, 156250, 390625, 1171875, 3515625, 10546875, 31640625, 94921875, 284765625, 854296875, 2562890625, 8884687500, 30800250000, 106774200000, 370150560000, 1283188608000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,10 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..850 Wikipedia, Partition of a set FORMULA a(n) = Product_{i=0..7} A000110(floor((n+i)/8)). EXAMPLE a(9) = 2: 19|2|3|4|5|6|7|8, 1|2|3|4|5|6|7|8|9. CROSSREFS Column k=8 of A275069. Cf. A000110. Sequence in context: A238938 A103662 A180211 * A275063 A186026 A023423 Adjacent sequences:  A275072 A275073 A275074 * A275076 A275077 A275078 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.

Last modified May 12 23:35 EDT 2021. Contains 343829 sequences. (Running on oeis4.)