The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062295 A B_2 sequence: a(n) is the smallest square such that pairwise sums of not necessarily distinct elements are all distinct. 4
 1, 4, 9, 16, 25, 36, 64, 81, 100, 169, 256, 289, 441, 484, 576, 625, 841, 1089, 1296, 1444, 1936, 2025, 2401, 2601, 3136, 4225, 4356, 4624, 5329, 5476, 5776, 6084, 7569, 9025, 10201, 11449, 11664, 12321, 12996, 13456, 14400, 16129, 17956, 20164, 22201 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Klaus Brockhaus, Table of n, a(n) for n = 1..4944 Eric Weisstein's World of Mathematics, B2-Sequence EXAMPLE 36 is in the sequence since the pairwise sums of {1, 4, 9, 16, 25, 36} are all distinct: 2, 5, 8, 10, 13, 17, 18, 20, 25, 26, 29, 32, 34, 37, 40, 41, 45, 50, 52, 61, 72. 49 is not in the sequence since 1 + 49 = 25 + 25. CROSSREFS Cf. A000290, A011185, A010672, A025582, A005282, A062292, A133743, A133744. Sequence in context: A328558 A072862 A300303 * A238203 A068802 A254073 Adjacent sequences:  A062292 A062293 A062294 * A062296 A062297 A062298 KEYWORD nonn AUTHOR Labos Elemer, Jul 02 2001 EXTENSIONS Edited, corrected and extended by Klaus Brockhaus, Sep 24 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 9 07:30 EDT 2020. Contains 333344 sequences. (Running on oeis4.)