|
%I #39 Jul 10 2023 20:39:21
%S 1,1,3,9,35,161,913,6103,47319,416235,4092155,44424095,527511445,
%T 6798907249,94504286703,1408973416617,22426222745159,379522092608177,
%U 6804315177704869,128828842646944135,2568533750228603835,53788282243854336411,1180357162840624656959
%N Number of arrangements of the partitions of n (e.g., 111 counts for 6).
%C All terms are odd. - _Alois P. Heinz_, Jul 10 2023
%H Alois P. Heinz, <a href="/A101880/b101880.txt">Table of n, a(n) for n = 0..450</a>
%H Jon Perry, <a href="http://www.users.globalnet.co.uk/~perry/maths/partitiontable/partitiontable.htm">Partition Tables</a> [broken link]
%F a(n) = Sum_{i=1..n} P(n,i)*i!, where P(n,i) is the number of partitions of n into i parts.
%F G.f.: Sum_{n=1..infinity} (n!*x^n / Product_{k=1..n} (1-x^k)). - _Vladeta Jovovic_, Jan 29 2005
%F G.f.: ( 1 - G(0) )/(1-x) where G(k) = 1 - (k+1)/(1-x^(k+1))/(1-x/(x-1/G(k+1) )); (recursively defined continued fraction). - _Sergei N. Gladkovskii_, Jan 22 2013
%F a(n) ~ n! * (1 + 1/n + 2/n^2 + 5/n^3 + 16/n^4 + 60/n^5 + 253/n^6 + 1180/n^7 + 6023/n^8 + 33306/n^9 + 197719/n^10 + ...), for coefficients see A331826. - _Vaclav Kotesovec_, Jan 28 2020
%e a(3) = 9 as we have 3, 12 (2) and 111 (6).
%e a(4) = 35 as 4, 31 (2), 22 (2), 211 (6) and 1111 (24).
%p b:= proc(n, i, p) option remember; `if`(n=0, p!,
%p `if`(i<1, 0, add(b(n-i*j, i-1, p+j), j=0..n/i)))
%p end:
%p a:= n-> b(n$2, 0):
%p seq(a(n), n=0..25); # _Alois P. Heinz_, Apr 06 2016
%t Rest[ CoefficientList[ Series[ Sum[ n!x^n / Product[1 - x^k, {k, n}], {n, 20}], {x, 0, 20}], x]] (* _Robert G. Wilson v_, Feb 10 2005 *)
%o (Sage)
%o from sage.combinat.partition import number_of_partitions_length
%o def A101880(n):
%o return sum(number_of_partitions_length(n, k)*factorial(k) for k in (0..n))
%o print([A101880(n) for n in (0..21)]) # _Peter Luschny_, Aug 01 2015
%Y Cf. A000142, A008284, A274174.
%K nonn,nice
%O 0,3
%A _Jon Perry_, Jan 28 2005
%E More terms from _Vladeta Jovovic_, Jan 29 2005
%E a(0)=1 prepended by _Alois P. Heinz_, Apr 06 2016
|
