id:A112663 - OEIS Search Results

Search: id:A112663

Displaying 1-1 of 1 results found.

page 1

Smallest circular sequence of period 32 such that any two adjacent numbers sum to a square number.

+0
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; listen)

	OFFSET	`0,2`
	COMMENT	`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 this_sequence A006377 A121739 A166729` `Adjacent sequences: A112660 A112661 A112662 this_sequence A112664 A112665 A112666`
	KEYWORD	`nonn`
	AUTHOR	`Federico Ramondino Dec 29 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research