|
%I #25 May 11 2018 05:43:17
%S 1,1,2,3,5,7,11,15,22,30,42,55,75,98,130,168,219,279,359,453,575,720,
%T 904,1122,1397,1722,2125,2603,3190,3883,4729,5725,6930,8349,10053,
%U 12053,14444,17243,20569,24457,29055,34414,40728,48070,56683,66682
%N Number of partitions of n into parts not of the form 23k, 23k+11 or 23k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 10 are greater than 1.
%C Case k=11, i=11 of Gordon Theorem.
%D G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
%H Seiichi Manyama, <a href="/A035999/b035999.txt">Table of n, a(n) for n = 0..1000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Andrews-GordonIdentity.html">Andrews-Gordon Identity</a>
%F a(n) ~ exp(2*Pi*sqrt(10*n/69)) * 10^(1/4) * cos(Pi/46) / (3^(1/4) * 23^(3/4) * n^(3/4)). - _Vaclav Kotesovec_, May 10 2018
%t nmax = 60; CoefficientList[Series[Product[(1 - x^(23*k))*(1 - x^(23*k+11-23))*(1 - x^(23*k-11))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] (* _Vaclav Kotesovec_, May 10 2018 *)
%K nonn,easy
%O 0,3
%A _Olivier Gérard_
%E a(0)=1 prepended by _Seiichi Manyama_, May 10 2018
|
