%I #41 Apr 27 2022 17:24:04
%S 0,0,0,0,0,0,0,1,1,2,3,5,7,11,15,23,31,44,59,82,108,146,191,254,328,
%T 429,549,709,900,1148,1446,1829,2286,2865,3559,4427,5465,6752,8288,
%U 10178,12429,15175,18442,22404,27102,32767,39473,47516,57012,68349,81703,97579,116236
%N Number of 8's in all partitions of n.
%C The sums of eight successive terms give A000070. - _Omar E. Pol_, Jul 12 2012
%C a(n) is also the difference between the sum of 8th largest and the sum of 9th largest elements in all partitions of n. - _Omar E. Pol_, Oct 25 2012
%H Alois P. Heinz, <a href="/A024792/b024792.txt">Table of n, a(n) for n = 1..1000</a>
%H David Benson, Radha Kessar, and Markus Linckelmann, <a href="https://arxiv.org/abs/2204.09970">Hochschild cohomology of symmetric groups in low degrees</a>, arXiv:2204.09970 [math.GR], 2022.
%F a(n) = A181187(n,8) - A181187(n,9). - _Omar E. Pol_, Oct 25 2012
%F From _Peter Bala_, Dec 26 2013: (Start)
%F a(n+8) - a(n) = A000041(n). a(n) + a(n+4) = A024788(n).
%F a(n) + a(n+2) + a(n+4) + a(n+6) = A024786(n).
%F O.g.f.: x^8/(1 - x^8) * product {k >= 1} 1/(1 - x^k) = x^8 + x^9 + 2*x^10 + 3*x^11 + ....
%F Asymptotic result: log(a(n)) ~ 2*sqrt(Pi^2/6)*sqrt(n) as n -> inf. (End)
%F a(n) ~ exp(Pi*sqrt(2*n/3)) / (16*Pi*sqrt(2*n)) * (1 - 97*Pi/(24*sqrt(6*n)) + (97/48 + 6337*Pi^2/6912)/n). - _Vaclav Kotesovec_, Nov 05 2016
%p b:= proc(n, i) option remember; local g;
%p if n=0 or i=1 then [1, 0]
%p else g:= `if`(i>n, [0$2], b(n-i, i));
%p b(n, i-1) +g +[0, `if`(i=8, g[1], 0)]
%p fi
%p end:
%p a:= n-> b(n, n)[2]:
%p seq(a(n), n=1..100); # _Alois P. Heinz_, Oct 27 2012
%t Table[ Count[ Flatten[ IntegerPartitions[n]], 8], {n, 1, 53} ]
%t (* second program: *)
%t b[n_, i_] := b[n, i] = Module[{g}, If[n == 0 || i == 1, {1, 0}, g = If[i > n, {0, 0}, b[n - i, i]]; b[n, i - 1] + g + {0, If[i == 8, g[[1]], 0]}]]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Oct 09 2015, after _Alois P. Heinz_ *)
%Y Cf. A000041, A066633, A024786, A024787, A024788, A024789, A024790, A024791, A024793, A024794.
%K nonn,easy
%O 1,10
%A _Clark Kimberling_
|