|
%I #32 Aug 08 2016 17:28:49
%S 1,2,5,15,52,203,877,4140,21147,115975,678570,4213596,27644358,
%T 190895863,1382847419,10477213268,82797679445,680685836527,
%U 5806124780384,51245294979716,466668627500968,4371727233798927,42000637216351225
%N Number of arrays of n 0..10 integers with new values introduced in order 0..10 but otherwise unconstrained.
%C From _Danny Rorabaugh_, Mar 03 2015: (Start)
%C a(n) is also the number of ways of placing n labeled balls into 11 indistinguishable boxes.
%C a(n) is also the number of word structures of length n using an 11-ary alphabet.
%C (End)
%H R. H. Hardin, <a href="/A203641/b203641.txt">Table of n, a(n) for n = 1..210</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SetPartition.html">Set Partition</a>.
%F Empirical: a(n) = 56*a(n-1) -1365*a(n-2) +19020*a(n-3) -167223*a(n-4) +965328*a(n-5) -3686255*a(n-6) +9133180*a(n-7) -13926276*a(n-8) +11655216*a(n-9) -3991680*a(n-10).
%F a(n) = Sum_{k=1..11} stirling2(n,k). - _Danny Rorabaugh_, Mar 03 2015
%F G.f.: Sum_{k=1..11} Product_{j=1..k} x/(1-j*x). This confirms the empirical recurrence. - _Robert Israel_, Aug 08 2016
%p f:= n -> add(Stirling2(n,k),k=1..11):
%p map(f, [$1..100]); # _Robert Israel_, Aug 08 2016
%o (PARI) a(n) = sum(k=1,11,stirling(n,k, 2)); \\ _Michel Marcus_, Mar 03 2015
%Y Column k=10 of A203647.
%Y Cf. A056272, A056273, A164863, A164864.
%K nonn,easy
%O 1,2
%A _R. H. Hardin_, Jan 04 2012
| 