cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A322883 Number of set partitions of [n] such that the maximal absolute difference between the least elements of consecutive blocks equals ten.

This page as a plain text file.
%I A322883 #5 Dec 29 2018 16:10:48
%S A322883 0,1,515,22253,430909,6094476,74507486,847129333,9296465127,
%T A322883 100540964675,1085004090887,11775039127122,129155075413877,
%U A322883 1436488582202316,16235344928131625,186710546094489052,2186538096666720967,26085011069325363939,317049671003606985326
%N A322883 Number of set partitions of [n] such that the maximal absolute difference between the least elements of consecutive blocks equals ten.
%H A322883 Alois P. Heinz, <a href="/A322883/b322883.txt">Table of n, a(n) for n = 10..579</a>
%H A322883 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A322883 a(n) = A287260(n) - A287259(n).
%p A322883 b:= proc(n, k, m, l) option remember; `if`(n<1, 1,
%p A322883      `if`(l-n>k, 0, b(n-1, k, m+1, n))+m*b(n-1, k, m, l))
%p A322883     end:
%p A322883 A:= (n, k)-> b(n-1, min(k, n-1), 1, n):
%p A322883 a:= n-> (k-> A(n, k)-A(n, k-1))(10):
%p A322883 seq(a(n), n=10..30);
%Y A322883 Column k=10 of A287215.
%Y A322883 Cf. A287259, A287260.
%K A322883 nonn
%O A322883 10,3
%A A322883 _Alois P. Heinz_, Dec 29 2018