|
%I M2734 #30 Aug 09 2019 12:17:51
%S 0,0,0,0,0,0,1,3,8,19,40,83,176,365,775,1643,3483,7299,15170,31010,
%T 62563,124221,243296,469856,896491,1690475,3155551,5834871,10701036,
%U 19479021,35227889,63335778,113286272,201687929,357585904,631574315,1111614614,1950096758,3410420973,5946337698,10337420278,17918573379,30968896662,53366449357,91689380979,157058043025,268210414468,456613323892
%N Difference between A000294 and the number of solid partitions of n (A000293).
%C Understanding this sequence is a famous unsolved problem in the theory of partitions.
%D G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 190.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Vaclav Kotesovec, <a href="/A007326/b007326.txt">Table of n, a(n) for n = 0..72</a>
%H A. O. L. Atkin, P. Bratley, I. G. McDonald and J. K. S. McKay, <a href="http://dx.doi.org/10.1017/S0305004100042171">Some computations for m-dimensional partitions</a>, Proc. Camb. Phil. Soc., 63 (1967), 1097-1100.
%H A. O. L. Atkin, P. Bratley, I. G. McDonald and J. K. S. McKay, <a href="/A000219/a000219.pdf">Some computations for m-dimensional partitions</a>, Proc. Camb. Phil. Soc., 63 (1967), 1097-1100. [Annotated scanned copy]
%Y a(n) = A000294(n) - A000293(n).
%Y Cf. A007327, A007328, A007329, A007330, A008780, A042984.
%K nonn
%O 0,8
%A _N. J. A. Sloane_, _Mira Bernstein_
%E Entry revised by _Sean A. Irvine_ and _N. J. A. Sloane_, Dec 18 2017
|
