Square loops: the number of circular permutations (reversals not counted as different) of the numbers 0 to n such that the sum of any two consecutive numbers is a square.
A108661
Square loops: the number of circular permutations (reversals not counted as different) of the numbers 0 to n such that the sum of any two consecutive numbers is a square.
Terms
- a(0) =6a(1) =3a(2) =3a(3) =72a(4) =226a(5) =358a(6) =309a(7) =391a(8) =547a(9) =813a(10) =3562a(11) =10741a(12) =36633a(13) =94547a(14) =120424a(15) =393670a(16) =676579a(17) =1088429a(18) =5531195a(19) =3294327a(20) =8335128a(21) =27820643a(22) =75288569a(23) =111875702a(24) =264015370a(25) =465407197a(26) =687532936a(27) =1109951444a(28) =3256360099
External references
- oeis: A108661