Sequences

392,541 sequences

T(2n,n-1), T given by A026659.A026661
T(2n,n-1), T given by A026659.
T(2n,n-2), T given by A026659.A026662
T(2n,n-2), T given by A026659.
T(2n-1,n-1), T given by A026659.A026663
T(2n-1,n-1), T given by A026659.
T(2n-1,n-2), T given by A026659.A026664
T(2n-1,n-2), T given by A026659.
T(n,[ n/2 ]), T given by A026659.A026665
T(n,[ n/2 ]), T given by A026659.
T(n,0) + T(n,1) + ... + T(n,n), T given by A026659.A026666
T(n,0) + T(n,1) + ... + T(n,n), T given by A026659.
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026659.A026667
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026659.
Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026659.A026668
Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026659.
Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026659.A026669
Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026659.
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for n >= 0; for n >= 1, T(n,1) = T(n,n-1) = n+1; for n >= 2, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and k = n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).A026670
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for n >= 0; for n >= 1, T(n,1) = T(n,n-1) = n+1; for n >= 2, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and k = n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).
Number of lattice paths from (0,0) to (n,n) with steps (0,1), (1,0) and, when on the diagonal, (1,1).A026671
Number of lattice paths from (0,0) to (n,n) with steps (0,1), (1,0) and, when on the diagonal, (1,1).
a(n) = T(2n,n-1), T given by A026670. Also T(2n,n-1)=T(2n+1,n+2), T given by A026725; and T(2n,n-1), T given by A026736.A026672
a(n) = T(2n,n-1), T given by A026670. Also T(2n,n-1)=T(2n+1,n+2), T given by A026725; and T(2n,n-1), T given by A026736.
a(n) = T(2n,n-2), T given by A026670.A026673
a(n) = T(2n,n-2), T given by A026670.
a(n) = T(2n-1,n-1) = T(2n,n+1), T given by A026725.A026674
a(n) = T(2n-1,n-1) = T(2n,n+1), T given by A026725.
a(n) = T(2n-1,n-2), T given by A026670. Also T(2n-1,n-2) = T(2n,n+2), T given by A026725 and T(2n,n-2), T given by A026736.A026675
a(n) = T(2n-1,n-2), T given by A026670. Also T(2n-1,n-2) = T(2n,n+2), T given by A026725 and T(2n,n-2), T given by A026736.
a(n) = T(n, floor(n/2)), T given by A026670.A026676
a(n) = T(n, floor(n/2)), T given by A026670.
T(n,0) + T(n,1) + ... + T(n,n), T given by A026670.A026677
T(n,0) + T(n,1) + ... + T(n,n), T given by A026670.
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026670.A026678
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026670.
Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026670.A026679
Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026670.
Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026670.A026680
Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026670.
Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1<=k<=n-1, T(n,k)=T(n-1,k-1)+T(n-1,k) if k or n-k is of form 2h for h=1,2,...,[ n/4 ], else T(n,k)=T(n-1,k-1)+T(n-2,k-1)+T(n-1,k).A026681
Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1<=k<=n-1, T(n,k)=T(n-1,k-1)+T(n-1,k) if k or n-k is of form 2h for h=1,2,...,[ n/4 ], else T(n,k)=T(n-1,k-1)+T(n-2,k-1)+T(n-1,k).
a(n) = A026681(2n,n).A026682
a(n) = A026681(2n,n).
T(2n,n-1), T given by A026681.A026683
T(2n,n-1), T given by A026681.
T(2n,n-2), T given by A026681.A026684
T(2n,n-2), T given by A026681.
T(2n-1,n-1), T given by A026681.A026685
T(2n-1,n-1), T given by A026681.
T(2n-1,n-2), T given by A026681.A026686
T(2n-1,n-2), T given by A026681.
T(n,[ n/2 ]), T given by A026681.A026687
T(n,[ n/2 ]), T given by A026681.
T(n,0) + T(n,1) + ... + T(n,n), T given by A026681.A026688
T(n,0) + T(n,1) + ... + T(n,n), T given by A026681.
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026681.A026689
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026681.
a(n) = Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026681.A026690
a(n) = Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026681.
Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026681.A026691
Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026681.
Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1<=k<=n-1, T(n,k)=T(n-1,k-1)+T(n-2,k-1)+T(n-1,k) if k or n-k is of form 2h for h=1,2,...,[ n/4 ], else T(n,k)=T(n-1,k-1)+T(n-1,k).A026692
Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1<=k<=n-1, T(n,k)=T(n-1,k-1)+T(n-2,k-1)+T(n-1,k) if k or n-k is of form 2h for h=1,2,...,[ n/4 ], else T(n,k)=T(n-1,k-1)+T(n-1,k).
T(2n,n), T given by A026692.A026693
T(2n,n), T given by A026692.
T(2n,n-1), T given by A026692.A026694
T(2n,n-1), T given by A026692.
T(2n,n-2), T given by A026692.A026695
T(2n,n-2), T given by A026692.
T(2n-1,n-1), T given by A026692.A026696
T(2n-1,n-1), T given by A026692.
T(2n-1,n-2), T given by A026692.A026697
T(2n-1,n-2), T given by A026692.
T(n,[ n/2 ]), T given by A026692.A026698
T(n,[ n/2 ]), T given by A026692.
T(n,0) + T(n,1) + ... + T(n,n), T given by A026692.A026699
T(n,0) + T(n,1) + ... + T(n,n), T given by A026692.
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026692.A026700
a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026692.
Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026692.A026701
Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026692.
a(n) = Sum_{k=0..floor(n/2)} T(n-k, k), T given by A026692.A026702
a(n) = Sum_{k=0..floor(n/2)} T(n-k, k), T given by A026692.
Triangular array T read by rows: T(n,1) = T(n,n) = 1, T(n,k) = T(n-1, k-1) + T(n-2,k-1) + T(n-1,k) if k=(n/2) or k=((n+1)/2), otherwise T(n,k) = T(n-1,k-1) + T(n-1,k).A026703
Triangular array T read by rows: T(n,1) = T(n,n) = 1, T(n,k) = T(n-1, k-1) + T(n-2,k-1) + T(n-1,k) if k=(n/2) or k=((n+1)/2), otherwise T(n,k) = T(n-1,k-1) + T(n-1,k).
T(2n,n), T given by A026703.A026704
T(2n,n), T given by A026703.
T(2n,n-1), T given by A026703.A026705
T(2n,n-1), T given by A026703.
T(2n,n-2), T given by A026703.A026706
T(2n,n-2), T given by A026703.
a(n) = T(2n-1,n-1), T given by A026703.A026707
a(n) = T(2n-1,n-1), T given by A026703.
T(2n-1,n-2), T given by A026703.A026708
T(2n-1,n-2), T given by A026703.
T(n,[ n/2 ]), T given by A026703.A026709
T(n,[ n/2 ]), T given by A026703.
T(n,1) + T(n,2) + ... + T(n,n), T given by A026703.A026710
T(n,1) + T(n,2) + ... + T(n,n), T given by A026703.