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!)
A306738 Number of permutations of [n] allowing i->i+j (mod n), j=0..ceiling(n/2)-1. 1
1, 1, 1, 2, 2, 13, 20, 144, 264, 2783, 6208, 79118, 204448, 3182225, 9411840, 170576156, 566725760, 11804363619, 43573050368, 1023207993178, 4152609019392, 108681408827381, 481065936784384, 13880706183899752 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = A008305(n,ceiling(n/2)).
CROSSREFS
Cf. A008305.
Sequence in context: A340587 A347080 A141575 * A151352 A155915 A173466
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 06 2019
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)