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!)
A287281 Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= nine. 4

%I #11 Dec 27 2018 20:45:10

%S 1,1,2,5,15,52,203,877,4140,21147,115975,657423,3827518,22762925,

%T 137649001,843059144,5212898020,32457312604,203096802134,

%U 1275403897840,8030979290267,50672180941765,320201670174878,2025623521511803,12824705758528817,81244888488645467

%N Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= nine.

%H Alois P. Heinz, <a href="/A287281/b287281.txt">Table of n, a(n) for n = 0..1000</a>

%H Alois P. Heinz, <a href="/A287281/a287281.txt">G.f. for A287281</a>

%H Pierpaolo Natalini, Paolo Emilio Ricci, <a href="https://doi.org/10.3390/axioms7040071">New Bell-Sheffer Polynomial Sets</a>, Axioms 2018, 7(4), 71.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>

%F G.f.: see link above.

%F a(n) = A287214(n,9).

%F a(n) = A000110(n) for n <= 10.

%Y Column k=9 of A287214.

%Y Cf. A000110.

%K nonn,easy

%O 0,3

%A _Alois P. Heinz_, May 22 2017

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 March 29 09:14 EDT 2024. Contains 371268 sequences. (Running on oeis4.)