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.

A229252 Number of set partitions of {1,...,n} with largest set of size 10.

This page as a plain text file.
%I A229252 #4 Sep 17 2013 19:33:00
%S A229252 1,11,132,1430,15015,156156,1625624,17055896,181158120,1953517566,
%T A229252 21426984722,239340203466,2724654560628,31626047962432,
%U A229252 374383760685660,4520229252281160,55662052670665870,698975472340315170,8949358054013356980,116803043793523277190
%N A229252 Number of set partitions of {1,...,n} with largest set of size 10.
%H A229252 Alois P. Heinz, <a href="/A229252/b229252.txt">Table of n, a(n) for n = 10..500</a>
%F A229252 E.g.f.: exp(Sum_{j=1..10} x^j/j!) - exp(Sum_{j=1..9} x^j/j!).
%p A229252 G:= proc(n, k) option remember; local j; if k>n then G(n, n)
%p A229252       elif n=0 then 1 elif k<1 then 0 else G(n-k, k);
%p A229252       for j from k-1 to 1 by -1 do %*(n-j)/j +G(n-j, k) od; % fi
%p A229252     end:
%p A229252 a:= n-> G(n,10)-G(n,9):
%p A229252 seq(a(n), n=10..30);
%Y A229252 Column k=10 of A080510.
%K A229252 nonn
%O A229252 10,2
%A A229252 _Alois P. Heinz_, Sep 17 2013