Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080654
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080654 Smallest number with exactly n representations as a sum of five positive squares. +0
2
5, 20, 29, 62, 53, 80, 77, 91, 101, 107, 128, 133, 131, 139, 166, 163, 181, 187, 179, 219, 203, 214, 227, 238, 211, 262, 275, 251, 291, 277, 314, 298, 259, 299, 326, 307, 399, 334, 374, 346, 347, 355, 373, 331, 411, 391, 430, 371, 445, 421, 394, 486, 379, 406 (list; graph; listen)
OFFSET

1,1

COMMENT

It seems as if 33 is the largest number with no such representation. 60 seems to be the largest one with exactly one representation.

EXAMPLE

a(4)=62 because there are exactly four representations as a sum of 5 squares: 62 = 1+4+4+4+49 = 1+4+16+16+25 = 4+4+4+25+25 = 4+4+9+9+36

CROSSREFS

Sequence in context: A034123 A088973 A005240 this_sequence A074219 A063133 A029528

Adjacent sequences: A080651 A080652 A080653 this_sequence A080655 A080656 A080657

KEYWORD

easy,nice,nonn

AUTHOR

Rainer Rosenthal (r.rosenthal(AT)web.de), Mar 01 2003

EXTENSIONS

More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 26 2004

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research