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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A287279 Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= seven. 4
 1, 1, 2, 5, 15, 52, 203, 877, 4140, 20270, 102004, 523700, 2726840, 14332663, 75789343, 402290332, 2140945657, 11413941169, 60921661218, 325417158033, 1739114057259, 9297387238139, 49715367098205, 265879355474309, 1422070344597675, 7606514013820659 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 Alois P. Heinz, G.f. for A287279 Pierpaolo Natalini, Paolo Emilio Ricci, New Bell-Sheffer Polynomial Sets, Axioms 2018, 7(4), 71. Wikipedia, Partition of a set FORMULA G.f.: see link above. a(n) = A287214(n,7). a(n) = A000110(n) for n <= 8. CROSSREFS Column k=7 of A287214. Cf. A000110. Sequence in context: A343668 A276724 A287586 * A287257 A287669 A099263 Adjacent sequences:  A287276 A287277 A287278 * A287280 A287281 A287282 KEYWORD nonn,easy AUTHOR Alois P. Heinz, May 22 2017 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 November 30 17:12 EST 2021. Contains 349424 sequences. (Running on oeis4.)