This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A112663 #8 Jun 26 2025 12:10:27
%S A112663 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 A112663 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 A112663 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 A112663 Smallest circular sequence of period 32 such that any two adjacent numbers sum to a square number.
%C A112663 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
%F A112663 a(n) = A272259(32, (n-1) mod 32) for all n, where "mod" is the (nonnegative) remainder operator. - _M. F. Hasler_, Jun 23 2025
%e A112663 1+8=9
%e A112663 8+28=36
%e A112663 28+21=49
%e A112663 ...
%e A112663 26+10=36
%e A112663 10+15=25
%e A112663 15+1=16
%o A112663 (PARI) apply( {A112663(n)=my(r=1);foreach(digits(403079653644429064719159, 6)[1..n%32],s,r=(s+2)^2-r); r}, [0..77]) \\ _M. F. Hasler_, Jun 23 2025
%Y A112663 Cf. A000217, A000290.
%Y A112663 Cf. A272259 (has terms a(0..31) in row 32).
%K A112663 nonn
%O A112663 0,2
%A A112663 Federico Ramondino, Dec 29 2005