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”).
%I #11 Jul 22 2018 14:28:09
%S 1,4,43,906,31493,1629248,117248463,11190963430,1367267690953,
%T 208031951035452,38563334673062963,8554779137299629314,
%U 2237467931691025532493,681305299577272105281016,238929711424864185326131543,95603626135129502838914478558
%N Number of permutations of [2n+1] with exactly n increasing runs of length two.
%H Alois P. Heinz, <a href="/A317140/b317140.txt">Table of n, a(n) for n = 0..242</a>
%F a(n) = A317139(2n+1) = A097592(2n+1,n).
%F a(n) + n == 1 (mod 2).
%e a(1) = 4: 132, 213, 231, 312.
%Y Bisection (odd part) of A317139.
%Y Cf. A097592.
%K nonn
%O 0,2
%A _Alois P. Heinz_, Jul 22 2018