Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091235
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091235 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)
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 13:45 EST 2009. Contains 170429 sequences.


AT&T Labs Research