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!)
A243753 Number A(n,k) of Dyck paths of semilength n avoiding the consecutive step pattern given by the binary expansion of k, where 1=U=(1,1) and 0=D=(1,-1); square array A(n,k), n>=0, k>=0, read by antidiagonals. 24

%I #28 Jan 24 2019 17:11:29

%S 1,1,0,1,0,0,1,0,0,0,1,1,0,0,0,1,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,1,0,

%T 0,0,1,1,1,2,1,1,0,0,0,1,1,2,1,4,1,1,0,0,0,1,1,2,4,1,9,1,1,0,0,0,1,1,

%U 2,4,9,1,21,1,1,0,0,0,1,1,1,4,9,21,1,51,1,1,0,0,0

%N Number A(n,k) of Dyck paths of semilength n avoiding the consecutive step pattern given by the binary expansion of k, where 1=U=(1,1) and 0=D=(1,-1); square array A(n,k), n>=0, k>=0, read by antidiagonals.

%H Alois P. Heinz, <a href="/A243753/b243753.txt">Antidiagonals n = 0..140, flattened</a>

%e Square array A(n,k) begins:

%e 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...

%e 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, ...

%e 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, ...

%e 0, 0, 0, 1, 1, 2, 1, 4, 4, 4, ...

%e 0, 0, 0, 1, 1, 4, 1, 9, 9, 9, ...

%e 0, 0, 0, 1, 1, 9, 1, 21, 21, 23, ...

%e 0, 0, 0, 1, 1, 21, 1, 51, 51, 63, ...

%e 0, 0, 0, 1, 1, 51, 1, 127, 127, 178, ...

%e 0, 0, 0, 1, 1, 127, 1, 323, 323, 514, ...

%e 0, 0, 0, 1, 1, 323, 1, 835, 835, 1515, ...

%p A:= proc(n, k) option remember; local b, m, r, h;

%p if k<2 then return `if`(n=0, 1, 0) fi;

%p m:= iquo(k, 2, 'r'); h:= 2^ilog2(k); b:=

%p proc(x, y, t) option remember; `if`(y<0 or y>x, 0, `if`(x=0, 1,

%p `if`(t=m and r=1, 0, b(x-1, y+1, irem(2*t+1, h)))+

%p `if`(t=m and r=0, 0, b(x-1, y-1, irem(2*t, h)))))

%p end; forget(b);

%p b(2*n, 0, 0)

%p end:

%p seq(seq(A(n, d-n), n=0..d), d=0..14);

%t A[n_, k_] := A[n, k] = Module[{b, m, r, h}, If[k<2, Return[If[n == 0, 1, 0]]]; {m, r} = QuotientRemainder[k, 2]; h = 2^Floor[Log[2, k]]; b[x_, y_, t_] := b[x, y, t] = If[y<0 || y>x, 0, If[x == 0, 1, If[t == m && r == 1, 0, b[x-1, y+1, Mod[2*t+1, h]]] + If[t == m && r == 0, 0, b[x-1, y-1, Mod[2*t, h]]]]]; b[2*n, 0, 0]]; Table[ Table[A[n, d-n], {n, 0, d}], {d, 0, 14}] // Flatten (* _Jean-François Alcover_, Jan 27 2015, after _Alois P. Heinz_ *)

%Y Columns give: 0, 1, 2: A000007, 3, 4, 6: A000012, 5: A001006(n-1) for n>0, 7, 8, 14: A001006, 9: A135307, 10: A078481 for n>0, 11, 13: A105633(n-1) for n>0, 12: A082582, 15, 16: A036765, 19, 27: A114465, 20, 24, 26: A157003, 21: A247333, 25: A187256(n-1) for n>0.

%Y Main diagonal gives A243754 or column k=0 of A243752.

%Y Cf. A242450, A243827, A243828, A243829, A243830, A243831, A243832, A243833, A243834, A243835, A243836.

%K nonn,tabl

%O 0,40

%A _Alois P. Heinz_, Jun 09 2014

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 June 9 08:35 EDT 2024. Contains 373231 sequences. (Running on oeis4.)