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!)
 A112663 Smallest circular sequence of period 32 such that any two adjacent numbers sum to a square number. 3
 1, 8, 28, 21, 4, 32, 17, 19, 30, 6, 3, 13, 12, 24, 25, 11, 5, 31, 18, 7, 29, 20, 16, 9, 27, 22, 14, 2, 23, 26, 10, 15, 1, 8, 28, 21, 4, 32, 17, 19, 30, 6, 3, 13, 12, 24, 25, 11, 5, 31, 18, 7, 29, 20, 16, 9, 27, 22, 14, 2, 23, 26, 10, 15, 1, 8, 28, 21, 4, 32, 17, 19, 30, 6, 3, 13, 12, 24, 25, 11, 5, 31, 18, 7, 29, 20, 16, 9, 27, 22, 14, 2, 23, 26, 10, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The terms of this sequence are given in A071984. An algorithm for computing circular chains of squares is given in A090460. - T. D. Noe, Dec 30 2005 LINKS EXAMPLE 1+8=9 8+28=36 28+21=49 ... 26+10=36 10+15=25 15+1=16 CROSSREFS Cf. A000217, A000290. Sequence in context: A126815 A053619 A272259 * A220288 A201101 A201105 Adjacent sequences:  A112660 A112661 A112662 * A112664 A112665 A112666 KEYWORD nonn AUTHOR Federico Ramondino Dec 29 2005 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 July 23 11:07 EDT 2021. Contains 346259 sequences. (Running on oeis4.)