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”).

A375022
Number of permutations of n (distinct) elements from [2n] without consecutive adjacent values.
2
1, 2, 6, 48, 650, 11604, 253890, 6572176, 196467642, 6660672060, 252504829346, 10584157180920, 486052773276954, 24267623565599428, 1308816525199710210, 75828568345500497184, 4696852810090223180090, 309727816544792336406156, 21664419864179709448539042
OFFSET
0,2
LINKS
FORMULA
a(n) = A338526(2n,n).
EXAMPLE
a(0) = 1: the empty permutation.
a(1) = 2: 1, 2.
a(2) = 6: 13, 14, 24, 31, 41, 42.
a(3) = 48: 135, 136, 142, 146, 152, 153, 162, 163, 164, 241, 246, 251, 253, 261, 263, 264, 314, 315, 316, 351, 352, 361, 362, 364, 413, 415, 416, 425, 426, 461, 462, 463, 513, 514, 516, 524, 526, 531, 536, 613, 614, 615, 624, 625, 631, 635, 641, 642.
CROSSREFS
Cf. A338526.
Sequence in context: A052735 A365286 A052717 * A365287 A129464 A175430
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 04 2024
STATUS
approved