id:A082647 - OEIS Search Results

Search: id:A082647

Displaying 1-1 of 1 results found.

page 1

Number of ways n can be expressed as the sum of d consecutive positive integers (where d>0 is a divisor of n).

+0
5

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; listen)

	OFFSET	`1,6`
	COMMENT	`Number of ways to present n as sum of odd number of consecutive integers. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 28 2007` `Number of odd divisors of n less than sqrt(2*n). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 16 2007`
	FORMULA	`G.f.: Sum_{k>0} x^(k(2k-1))/(1-x^(2*k-1)). - Vladeta Jovovic (vladeta(AT)Eunet.yu), 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: A069288 A097795 A138742 this_sequence A029322 A112195 A103956` `Adjacent sequences: A082644 A082645 A082646 this_sequence A082648 A082649 A082650`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), May 15 2003`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research