|
Search: id:A063883
|
|
|
| A063883 |
|
Number of ways writing n as a sum of different Mersenne prime exponents (terms of A000043). |
|
+0
3
|
|
| 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 0, 2, 1, 1, 2, 1, 2, 2, 2, 3, 2, 4, 2, 4, 3, 3, 4, 2, 4, 2, 4, 3, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 4, 5, 3, 5, 3, 4, 4, 3, 5, 3, 5, 4, 4, 5, 4, 5, 4, 4, 5, 3, 5, 4, 3, 6, 2, 6, 3, 5, 5, 3, 6, 3, 5, 4, 4, 4, 4, 4, 4, 4, 5, 3, 6, 3, 5, 5, 4, 6, 3, 7, 3, 6, 5, 5, 6, 5, 6, 5, 6, 6, 5, 6, 6
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Comment from T. D. Noe, Oct 12 2006: This sequence appears to be growing. However, for 704338<n<756839, a(n) is 0. See A078426 for the n such that a(n)=0.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
EXAMPLE
|
n = 50 = 2 + 5 + 7 + 17 + 19 = 2 + 17 + 31 = 19 + 31, so a(50) = 3 The first numbers whose the number of these Mersenne-exponent partitions is k = 0, 1, 2, 3, 4, 5, 6, 7, 8 are 1, 2, 5, 20, 22, 39, 66, 92, 107 respectively.
|
|
CROSSREFS
|
Cf. A000043, A046528, A048947, A063889, A054784.
Sequence in context: A116664 A024161 A035156 this_sequence A079691 A104450 A035226
Adjacent sequences: A063880 A063881 A063882 this_sequence A063884 A063885 A063886
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Aug 28 2001
|
|
|
Search completed in 0.002 seconds
|
