|
Search: id:A002850
|
|
|
| A002850 |
|
Number of decompositions of 2n into sum of 2 lucky numbers.
(Formerly M0071 N0023)
|
|
+0
2
|
|
| 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, 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
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
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
|
|
REFERENCES
|
V. Gardiner, R.Lazarus, N. Metropolis and S. Ulam, On certain sequences of integers defined by sieves, Math. Mag., 29 (1955), 117-119.
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.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
CROSSREFS
|
Cf. A000959.
Sequence in context: A043554 A005811 A008342 this_sequence A111944 A111776 A109814
Adjacent sequences: A002847 A002848 A002849 this_sequence A002851 A002852 A002853
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Paul Zimmermann points out that the second term was incorrectly given as 2 in the Encyclopedia of Integer Sequences.
|
|
|
Search completed in 0.002 seconds
|
