Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065015
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065015 Sum divides product: number of integer solutions (w,x,y,z), w>=x>=y>=z>0, to the equation w*x*y*z = n*(w+x+y+z). +0
1
1, 5, 4, 8, 6, 14, 7, 15, 12, 22, 7, 26, 9, 24, 23, 30, 8, 42, 11, 31, 21, 29, 12, 56, 18, 32, 27, 48, 13, 68, 11, 42, 35, 40, 32, 65, 9, 35, 30, 76, 9, 87, 18, 51, 49, 39, 18, 97, 27, 70, 31, 52, 14, 108, 36, 72, 33, 52, 17, 120, 15, 37, 66, 90, 36, 93, 12, 63, 44, 123, 19, 130 (list; graph; listen)
page 1

Search completed in 0.002 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research