Square loops: the number of circular permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square.
A071984
Square loops: the number of circular permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square.
Terms
- a(0) =1a(1) =1a(2) =11a(3) =57a(4) =31a(5) =20a(6) =25a(7) =50a(8) =64a(9) =464a(10) =1062a(11) =4337a(12) =10091a(13) =21931a(14) =69623a(15) =115913a(16) =227893a(17) =457707a(18) =297126a(19) =1051583a(20) =3377189a(21) =7618873a(22) =12476654a(23) =25832098a(24) =55792448a(25) =75126741a(26) =129180538a(27) =357114149a(28) =823402071a(29) =3902161448
External references
- oeis: A071984