Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005842
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005842 a(n) = minimal integer m such that an m X m square contains all squares of sides 1, ..., n (some values are only conjectures).
(Formerly M2401)
+0
3
1, 3, 5, 7, 9, 11, 13, 15, 18, 21, 24, 27, 30, 33, 36, 39, 43, 47, 50, 54, 58, 62, 66, 71, 75, 80, 84, 89, 93, 98, 103, 108, 113, 118, 123, 128, 133, 139, 144, 150, 155, 161, 166, 172, 178, 184, 190, 196, 202, 208, 214, 221, 227, 233, 240, 246 (list; graph; listen)
page 1

Search completed in 0.004 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