|
| |
|
|
A082647
|
|
Number of ways n can be expressed as the sum of d consecutive positive integers (where d>0 is a divisor of n).
|
|
4
| |
|
|
1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 1, 3, 1, 1, 2, 1, 3, 2, 1, 1, 2, 2, 1, 3, 1, 1, 4, 1, 1, 2, 2, 2, 2, 1, 1, 3, 2, 2, 2, 1, 1, 3, 1, 1, 4, 1, 2, 3, 1, 1, 2, 3, 1, 3, 1, 1, 3, 1, 3, 2, 1, 2, 3, 1, 1, 3, 2, 1, 2, 2, 1, 4, 3, 1, 2, 1, 2, 2, 1, 2, 4, 2, 1, 2, 1, 2, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| Number of ways to present n as sum of odd number of consecutive integers. - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 28 2007
Number of odd divisors of n less than sqrt(2*n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 16 2007
|
|
|
FORMULA
| G.f.: Sum_{k>0} x^(k*(2*k-1))/(1-x^(2*k-1)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 25 2004
|
|
|
EXAMPLE
| For n=6: 6 has two ways: e.g. (d=3; 3|6) and 1+2+3=6, (d=1; 1|6) and 6=6. so a(6)=2.
|
|
|
CROSSREFS
| Cf. A001227, A082637.
Cf. A054843.
Sequence in context: A161072 A161111 A161046 * A161071 A161110 A161045
Adjacent sequences: A082644 A082645 A082646 * A082648 A082649 A082650
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Naohiro Nomoto (n_nomoto(AT)yabumi.com), May 15 2003
|
| |
|
|
