Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #2 Mar 30 2012 17:22:41
%S 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,
%T 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,
%U 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
%N Smallest circular sequence of period 32 such that any two adjacent numbers sum to a square number.
%C 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
%e 1+8=9
%e 8+28=36
%e 28+21=49
%e ...
%e 26+10=36
%e 10+15=25
%e 15+1=16
%Y Cf. A000217, A000290.
%K nonn
%O 0,2
%A Federico Ramondino Dec 29 2005