%I M0071 N0023
%N Number of decompositions of 2n into sum of 2 lucky numbers.
%C In general, a(3n-1) is larger than a(3n-2) and a(3n), which explains the bimodal nature of the graph. - _T. D. Noe_, Jan 29 2007
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D M. L. Stein and P. R. Stein, Tables of the Number of Binary Decompositions of All Even Numbers Less Than 200,000 into Prime Numbers and Lucky Numbers. Report LA-3106, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Sep 1964.
%H T. D. Noe, <a href="/A002850/b002850.txt">Table of n, a(n) for n=1..10000</a>
%H V. Gardiner, R.Lazarus, N. Metropolis and S. Ulam, <a href="http://www.jstor.org/stable/3029719">On certain sequences of integers defined by sieves</a>, Math. Mag., 29 (1955), 117-119.
%Y Cf. A000959.
%A _N. J. A. Sloane_.
%E _Paul Zimmermann_ points out that the second term was incorrectly given as 2 in the Encyclopedia of Integer Sequences.
%E Missing a(71)-a(73) inserted by _Sean A. Irvine_, Nov 05 2014