login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025415 Least sum of 3 distinct nonzero squares in exactly n ways. 3
14, 62, 101, 161, 206, 314, 341, 446, 689, 734, 854, 1106, 1154, 1286, 1454, 1781, 1889, 2054, 2141, 2609, 2966, 3134, 3461, 3449, 3506, 4241, 4289, 4781, 5066, 4826, 5381, 5561, 7686, 7094, 6254, 7829, 8186, 8069, 8609, 8126, 8774, 9686, 10526, 11066 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Index entries for sequences related to sums of squares

Zak Seidov, Table of n, a(n) for n = 1..200

Zak Seidov, First 300 terms of A025415

CROSSREFS

Sequence in context: A164540 A140184 A189948 * A125849 A003695 A022674

Adjacent sequences:  A025412 A025413 A025414 * A025416 A025417 A025418

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.