%I A002850 M0071 N0023
%S A002850 1,1,1,1,2,1,2,3,2,1,3,2,2,3,2,2,4,2,3,4,2,3,5,1,4,5,2,3,5,1,3,5,3,
%T A002850 3,5,3,5,7,3,5,7,4,4,7,3,3,7,4,3,9,5,3,7,5,3,8,5,4,8,5,3,7,5,3,9,4,3,12,
               6
%N A002850 Number of decompositions of 2n into sum of 2 lucky numbers.
%C A002850 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 A002850 V. Gardiner, R.Lazarus, N. Metropolis and S. Ulam, On certain sequences 
               of integers defined by sieves, Math. Mag., 29 (1955), 117-119.
%D A002850 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002850 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A002850 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 A002850 T. D. Noe, <a href="b002850.txt">Table of n, a(n) for n=1..10000</a>
%Y A002850 Cf. A000959.
%Y A002850 Sequence in context: A043554 A005811 A008342 this_sequence A111944 A109814 
               A133088
%Y A002850 Adjacent sequences: A002847 A002848 A002849 this_sequence A002851 A002852 
               A002853
%K A002850 nonn,easy,nice
%O A002850 1,5
%A A002850 N. J. A. Sloane (njas(AT)research.att.com).
%E A002850 Paul Zimmermann points out that the second term was incorrectly given 
               as 2 in the Encyclopedia of Integer Sequences.