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

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. 2
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; 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 (noe(AT)sspectra.com), Dec 30 2005

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: A088029 A126815 A053619 * A201101 A201105 A184614

Adjacent sequences:  A112660 A112661 A112662 * A112664 A112665 A112666

KEYWORD

nonn

AUTHOR

Federico Ramondino Dec 29 2005

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 12 07:18 EST 2012. Contains 205372 sequences.