|
| |
|
|
A071640
|
|
a(n) = sum(i=1, n, A040051(i) ).
|
|
3
| |
|
|
1, 1, 2, 3, 4, 5, 6, 6, 6, 6, 6, 7, 8, 9, 9, 10, 11, 12, 12, 13, 13, 13, 14, 15, 15, 15, 15, 15, 16, 16, 16, 17, 18, 18, 19, 20, 21, 22, 23, 23, 24, 24, 25, 26, 26, 26, 26, 27, 28, 28, 29, 30, 31, 32, 32, 33, 33, 33, 33, 34, 35, 35, 36, 36, 36, 36, 37, 38, 39, 39, 40, 41, 42, 42
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| Does 2*a(n) > n for n>2? Cf. A086144. - Benoit Cloitre
No. First failure is at n = 6662. - Peter Luschny, Oct 5 2011
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 1..1000
|
|
|
MAPLE
| A071640 := proc(n) option remember; if n=1 then 1 else A071640(n-1)+
(combinat[numbpart](n) mod 2) fi end: # Peter Luschny, Oct 5 2011
|
|
|
PROG
| (PARI) for(n=1, 150, print1(sum(i=1, n, (1-(-1)^(polcoeff(1/eta(x), i, x)))/2), ", "))
|
|
|
CROSSREFS
| Cf. A000041, A086144, A040051, A087177.
Sequence in context: A034151 A101272 A006160 * A102674 A097623 A198462
Adjacent sequences: A071637 A071638 A071639 * A071641 A071642 A071643
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 2002
|
| |
|
|
