login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)