id:A085491 - OEIS Search Results

Search: id:A085491

Displaying 1-1 of 1 results found.

page 1

Number of ways to write n as sum of distinct divisors of n+1.

+0
5

1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 5, 0, 0, 0, 1, 0, 3, 0, 1, 0, 0, 0, 5, 0, 0, 0, 3, 0, 2, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 31, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 26, 0, 0, 0, 0, 0, 1, 0, 6, 0, 0, 0, 23, 0, 0, 0, 1, 0, 20, 0, 0, 0, 0, 0, 21, 0, 0, 0, 1 (list; graph; listen)

	OFFSET	`1,11`
	COMMENT	`a(A085492(n)) = 0; a(A085493(n)) > 0; a(A085494(n)) = 1.`
	EXAMPLE	`n=11, divisors of 12=11+1 that are not greater 11: {1,2,3,4,6},` `11=6+5=6+4+1, therefore a(11)=2.`
	CROSSREFS	`Cf. A085496.` `Sequence in context: A088183 A070140 A081212 this_sequence A116681 A131371 A003475` `Adjacent sequences: A085488 A085489 A085490 this_sequence A085492 A085493 A085494`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 03 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research