id:A091235 - OEIS Search Results

Search: id:A091235

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.

+0
2

20, 21, 14, 220, 208, 791, 161, 181, 2330, 181, 134, 25068, 181, 92, 24243, 181, 1774, 22681, 92, 22282, 22140, 531, 181, 62, 21885, 1427, 181, 2320401, 21213, 20737, 181, 17188, 701341, 20695, 19950, 16949, 1911, 2159976, 181, 1020 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n) = A091234(A005101(n)).`
	LINKS	`Eric Weisstein's World of Mathematics, Abundant Number`
	CROSSREFS	`Sequence in context: A040381 A022354 A165841 this_sequence A078286 A004461 A008553` `Adjacent sequences: A091232 A091233 A091234 this_sequence A091236 A091237 A091238`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 27 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research