Sequences

392,541 sequences

Triangular array T read by rows: T(n,k) = t(n, 2k+1) for 0 <= k <= floor((2n-1)/2), t given by A027960, n >= 0.A027011
Triangular array T read by rows: T(n,k) = t(n, 2k+1) for 0 <= k <= floor((2n-1)/2), t given by A027960, n >= 0.
a(n) = T(2*n, n+1), T given by A027011.A027012
a(n) = T(2*n, n+1), T given by A027011.
a(n) = T(2*n, n+2), T given by A027011.A027013
a(n) = T(2*n, n+2), T given by A027011.
a(n) = T(2*n, n+3), T given by A027011.A027014
a(n) = T(2*n, n+3), T given by A027011.
a(n) = A027011(2n, n+4).A027015
a(n) = A027011(2n, n+4).
T(2n+1,n+1), T given by A027011.A027016
T(2n+1,n+1), T given by A027011.
a(n) = T(2*n+1, n+2), T given by A027011.A027017
a(n) = T(2*n+1, n+2), T given by A027011.
a(n) = T(2*n+1, n+3), T given by A027011.A027018
a(n) = T(2*n+1, n+3), T given by A027011.
a(n) = A027011(2n+1, n+4).A027019
a(n) = A027011(2n+1, n+4).
a(n) = greatest number in row n of array T given by A027011.A027020
a(n) = greatest number in row n of array T given by A027011.
a(n) = T(n,n) + T(n,m+1) + ... + T(n,n), where m=[ (n+2)/2 ], T given by A027011.A027021
a(n) = T(n,n) + T(n,m+1) + ... + T(n,n), where m=[ (n+2)/2 ], T given by A027011.
a(n) = Sum_{k=floor((n+1)/2)..n} T(k,n-k); i.e., a(n) is n-th diagonal sum of left-justified array T given by A027011.A027022
a(n) = Sum_{k=floor((n+1)/2)..n} T(k,n-k); i.e., a(n) is n-th diagonal sum of left-justified array T given by A027011.
Tribonacci array: triangular array T read by rows: T(n,0)=1 for n >= 0, T(n,1) = T(n,2n) = 1 for n >= 1, T(n,2)=1 for n >= 2 and for n >= 3, T(n,k) = T(n-1,k-3) + T(n-1,k-2) + T(n-1,k-1) for 3 <= k <= 2n-1.A027023
Tribonacci array: triangular array T read by rows: T(n,0)=1 for n >= 0, T(n,1) = T(n,2n) = 1 for n >= 1, T(n,2)=1 for n >= 2 and for n >= 3, T(n,k) = T(n-1,k-3) + T(n-1,k-2) + T(n-1,k-1) for 3 <= k <= 2n-1.
a(n) = T(n,n+2), T given by A027023.A027024
a(n) = T(n,n+2), T given by A027023.
a(n) = T(n,n+3), T given by A027023.A027025
a(n) = T(n,n+3), T given by A027023.
a(n) = T(n,n+4), T given by A027023.A027026
a(n) = T(n,n+4), T given by A027023.
a(n) = T(n, 2n-3), T given by A027023.A027027
a(n) = T(n, 2n-3), T given by A027023.
a(n) = T(n,2n-4), T given by A027023.A027028
a(n) = T(n,2n-4), T given by A027023.
a(n) = T(n,2n-5), T given by A027023.A027029
a(n) = T(n,2n-5), T given by A027023.
a(n) = T(n,2n-6), T given by A027023.A027030
a(n) = T(n,2n-6), T given by A027023.
a(n) = T(n,2n-7), T given by A027023.A027031
a(n) = T(n,2n-7), T given by A027023.
a(n) = T(n,2n-8), T given by A027023.A027032
a(n) = T(n,2n-8), T given by A027023.
a(n) = T(n,2n-9), T given by A027023.A027033
a(n) = T(n,2n-9), T given by A027023.
a(n) = T(n,2n-10), T given by A027023.A027034
a(n) = T(n,2n-10), T given by A027023.
a(n) = Sum_{k=0..n} T(n,n+k), T given by A027023.A027035
a(n) = Sum_{k=0..n} T(n,n+k), T given by A027023.
Partial sums of A027035.A027036
Partial sums of A027035.
Diagonal sum of left-justified array T given by A027023.A027037
Diagonal sum of left-justified array T given by A027023.
Diagonal sum of right-justified array T given by A027023.A027038
Diagonal sum of right-justified array T given by A027023.
a(n) = greatest number in row n of array T given by A027023.A027039
a(n) = greatest number in row n of array T given by A027023.
a(n) = self-convolution of row n of array T given by A027023.A027040
a(n) = self-convolution of row n of array T given by A027023.
a(n) = Sum_{k=0..n} T(n,k) * T(n,2n-k), with T given by A027023.A027041
a(n) = Sum_{k=0..n} T(n,k) * T(n,2n-k), with T given by A027023.
a(n) = Sum_{k=0..n-1} T(n,k) * T(n,2n-k), with T given by A027023.A027042
a(n) = Sum_{k=0..n-1} T(n,k) * T(n,2n-k), with T given by A027023.
a(n) = Sum_{k=0..2n} (k+1) * A027023(n,k).A027043
a(n) = Sum_{k=0..2n} (k+1) * A027023(n,k).
a(n) = Sum_{k=0..2n} (k+1) * A027023(n,2n-k).A027044
a(n) = Sum_{k=0..2n} (k+1) * A027023(n,2n-k).
a(n) = Sum_{k=n+1..2*n} T(n, k), T given by A027023.A027045
a(n) = Sum_{k=n+1..2*n} T(n, k), T given by A027023.
a(n) = Sum_{k=0..n} T(n,k) * T(n,n+k), with T given by A027023.A027046
a(n) = Sum_{k=0..n} T(n,k) * T(n,n+k), with T given by A027023.
a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A027023.A027047
a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A027023.
a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A027023.A027048
a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A027023.
a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A027023.A027049
a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A027023.
a(n) = T(n,2n-1), T given by A027023.A027050
a(n) = T(n,2n-1), T given by A027023.
a(n) = T(n,2n-2), T given by A027023.A027051
a(n) = T(n,2n-2), T given by A027023.
Triangular array T read by rows: T(n,0) = T(n,2n) = 1 for n >= 0, T(n,1)=0 for n >= 1, T(n,2)=1 for n >= 2 and for n >= 3, T(n,k) = T(n-1,k-3) + T(n-1, k-2) + T(n-1,k-1) for 3 <= k <= 2n-1. T(n,k)=0 for k < 0 or k > 2n.A027052
Triangular array T read by rows: T(n,0) = T(n,2n) = 1 for n >= 0, T(n,1)=0 for n >= 1, T(n,2)=1 for n >= 2 and for n >= 3, T(n,k) = T(n-1,k-3) + T(n-1, k-2) + T(n-1,k-1) for 3 <= k <= 2n-1. T(n,k)=0 for k < 0 or k > 2n.
a(n) = T(n,n+2), T given by A027052.A027053
a(n) = T(n,n+2), T given by A027052.
a(n) = T(n, n+3), T given by A027052.A027054
a(n) = T(n, n+3), T given by A027052.
a(n) = T(n, n+4), T given by A027052.A027055
a(n) = T(n, n+4), T given by A027052.
a(n) = A027052(n, 2n-1).A027056
a(n) = A027052(n, 2n-1).
a(n) = (1/2) * A027052(n, 2n-1).A027057
a(n) = (1/2) * A027052(n, 2n-1).
a(n) = A027052(n, 2n-2).A027058
a(n) = A027052(n, 2n-2).
a(n) = A027052(n, 2n-3).A027059
a(n) = A027052(n, 2n-3).
a(n) = T(n,2n-4), T given by A027052.A027060
a(n) = T(n,2n-4), T given by A027052.