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 A345655 #46 Jul 21 2021 10:10:00 %S A345655 0,0,0,0,35,210,1596,12992,118863,1202870,13361392,161638752, %T A345655 2115684259,29792671818,449145795900,7217975402752,123180993414207, %U A345655 2224874726830638,42402252681323840,850380681002034880,17902407539998807875,394741856473979171586,9097740802923890621468 %N A345655 a(n) is the number of permutations w of [n] with no w(i)+1 == w(i+1) (mod n) that are not simply cyclic permutations of the numbers 1 to n in backwards order. %F A345655 a(n) = A167760(n) - n for n >= 3. %F A345655 a(n) = max(0, A167760(n) - n). %Y A345655 Cf. A167760. %K A345655 nonn %O A345655 1,5 %A A345655 _J. Lowell_, Jun 21 2021