Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036466
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036466 If n=sum a_i^2, then a(n) is the smallest possible value of the largest multiplicity of the a_i. +0
1
1, 4, 2, 1, 1, 2, 3, 2, 1, 1, 2, 3, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(12)=3 since 12 = 2^2 + 2^2 + 2^2 = 3^2 + 1^2 + 1^2 + 1^2 and 3 of the same square are needed.

CROSSREFS

Sequence in context: A010312 A068930 A144260 this_sequence A097526 A051149 A152145

Adjacent sequences: A036463 A036464 A036465 this_sequence A036467 A036468 A036469

KEYWORD

nonn

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research