|
| |
|
|
A071754
|
|
Sum(k=0,n, pp(k)) where pp(k) is the parity of p(k) the k-th partition number = A040051(k).
|
|
5
| |
|
|
1, 2, 2, 3, 4, 5, 6, 7, 7, 7, 7, 7, 8, 9, 10, 10, 11, 12, 13, 13, 14, 14, 14, 15, 16, 16, 16, 16, 16, 17, 17, 17, 18, 19, 19, 20, 21, 22, 23, 24, 24, 25, 25, 26, 27, 27, 27, 27, 28, 29, 29, 30, 31, 32, 33, 33, 34, 34, 34, 34, 35, 36, 36, 37, 37, 37, 37, 38, 39, 40, 40, 41, 42, 43
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| It appears that there is a constant A > 0 such that for any n>1: An/log(n) < 2a(n) - n < n/Log(n) and that lim n ->infinity (2*a(n) - n )/(n/Log(n)) exists. - Benoit Cloitre, Jan 29 2006
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 0..1000
|
|
|
PROG
| (PARI) \ps100 s=0; for(n=0, 80, s=s+(1-(-1)^polcoeff(1/eta(x), n, x))/2; print1(s, ", "))
|
|
|
CROSSREFS
| Sequence in context: A072586 A028391 A038668 * A078171 A157282 A114010
Adjacent sequences: A071751 A071752 A071753 * A071755 A071756 A071757
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 24 2002
|
| |
|
|
