The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A364817 Triangle read by rows: T(n,k) = number of permutations p of [n] such that max(|p(p(i)) - i|)=k (n>=1, 0<=k<=n-1). 1
1, 2, 0, 4, 0, 2, 10, 2, 6, 6, 26, 6, 22, 36, 30, 76, 24, 92, 144, 216, 168, 232, 80, 334, 640, 1150, 1524, 1080, 764, 312, 1328, 2984, 5516, 9712, 11784, 7920, 2620, 1152, 5234, 13296, 27668, 55750, 90240, 101400, 65520, 9496, 4616, 21780, 62124, 144564, 306272, 601756, 909312, 964080, 604800 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
T(n,n-1) = (2*n-5)*(n-2)! for n>3.
EXAMPLE
Triangle starts:
1;
2, 0;
4, 0, 2;
10, 2, 6, 6;
26, 6, 22, 36, 30;
76, 24, 92, 144, 216, 168;
232, 80, 334, 640, 1150, 1524, 1080;
764, 312, 1328, 2984, 5516, 9712, 11784, 7920;
2620, 1152, 5234, 13296, 27668, 55750, 90240, 101400, 65520;
CROSSREFS
Columns k=0..1 give: A000085, A364819.
Row sums give A000142.
Sequence in context: A335872 A239489 A259759 * A119607 A279968 A164297
KEYWORD
nonn,tabl
AUTHOR
Seiichi Manyama, Oct 21 2023
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 May 23 11:57 EDT 2024. Contains 372763 sequences. (Running on oeis4.)