id:A065205 - OEIS Search Results

Search: id:A065205

Displaying 1-1 of 1 results found.

page 1

Number of subsets of proper divisors of n that sum to n.

+0
9

0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 5, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 0, 7, 0, 0, 0, 3, 0, 2, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 3, 0, 2, 0, 0, 0, 34, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 31, 0, 0, 0, 0, 0, 1, 0, 6, 0, 0, 0, 25, 0, 0, 0, 1, 0, 23, 0, 0, 0, 0, 0, 21, 0, 0, 0, 2 (list; graph; listen)

	OFFSET	`1,12`
	COMMENT	`Deficient and weird numbers have a(n)=0, perfect numbers and others (see A064771) have a(n)=1.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	EXAMPLE	`{1,4,5,10} is the only subset of proper divisors of 20 that sum to 20, so a(20)=1.`
	CROSSREFS	`Cf. A064771.` `a(n) = A033630(n) - 1.` `Sequence in context: A143840 A028649 A097798 this_sequence A036272 A083339 A133827` `Adjacent sequences: A065202 A065203 A065204 this_sequence A065206 A065207 A065208`
	KEYWORD	`nonn`
	AUTHOR	`Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 19 2001`
	EXTENSIONS	`More terms and additional comments from Jud McCranie (j.mccranie(AT)comcast.net), Oct 21 2001`

page 1

Search completed in 0.002 seconds

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.

AT&T Labs Research