Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111302
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111302 Define a(1)=1. a(n) is the smallest positive integer with the property that a(n)^2 cannot be created by summing the squares of at most n values chosen among the previous terms (with repeats allowed). +0
1
1, 2, 4, 9, 12, 16, 27, 49, 69, 118 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(3) <> 3 because we can write 3^2=a(2)^2+a(2)^2+a(1)^2 by using not more than 3 terms.

But it is impossbile to write 4^2 as the sum of at most three squares of the previous elements, thus a(3)=4.

CROSSREFS

Sequence in context: A022428 A096186 A088901 this_sequence A092530 A139557 A103690

Adjacent sequences: A111299 A111300 A111301 this_sequence A111303 A111304 A111305

KEYWORD

nonn,more

AUTHOR

Stefan Steinerberger (hansibal(AT)hotmail.com), Nov 02 2005

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 August 8 13:43 EDT 2008. Contains 142651 sequences.


AT&T Labs Research