login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
0
0, 0, 0, 0, 35, 210, 1596, 12992, 118863, 1202870, 13361392, 161638752, 2115684259, 29792671818, 449145795900, 7217975402752, 123180993414207, 2224874726830638, 42402252681323840, 850380681002034880, 17902407539998807875, 394741856473979171586, 9097740802923890621468
OFFSET
1,5
FORMULA
a(n) = A167760(n) - n for n >= 3.
a(n) = max(0, A167760(n) - n).
CROSSREFS
Cf. A167760.
Sequence in context: A219942 A232713 A007329 * A101628 A064013 A240137
KEYWORD
nonn
AUTHOR
J. Lowell, Jun 21 2021
STATUS
approved