Sequences

392,541 sequences

a(n) = T(2*n+1,n), with T given by A027907.A027911
a(n) = T(2*n+1,n), with T given by A027907.
T(2n-1,n-2), T given by A027907.A027912
T(2n-1,n-2), T given by A027907.
T(n,[ n/2 ]), T given by A027907.A027913
T(n,[ n/2 ]), T given by A027907.
T(n,0) + T(n,1) + ... + T(n,n), T given by A027907.A027914
T(n,0) + T(n,1) + ... + T(n,n), T given by A027907.
a(n) = Sum_{0<=j<=i, 0<=i<=n} A027907(i, j).A027915
a(n) = Sum_{0<=j<=i, 0<=i<=n} A027907(i, j).
Least k such that 1+2+...+k >= E{1,2,...,n}, where E = 2nd elementary symmetric function.A027916
Least k such that 1+2+...+k >= E{1,2,...,n}, where E = 2nd elementary symmetric function.
a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.A027917
a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.
Least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 4th elementary symmetric function.A027918
Least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 4th elementary symmetric function.
a(n) = least k such that 2nd elementary symmetric function of {1,2,...,k+1} >= 3rd elementary symmetric function of {1,2,...,n}.A027919
a(n) = least k such that 2nd elementary symmetric function of {1,2,...,k+1} >= 3rd elementary symmetric function of {1,2,...,n}.
Least k such that 2nd elementary symmetric function of {1,2,...,k} >= 4th elementary symmetric function of {1,2,...,n}.A027920
Least k such that 2nd elementary symmetric function of {1,2,...,k} >= 4th elementary symmetric function of {1,2,...,n}.
a(n) = least k such that 3rd elementary symmetric function of {1,2,...,k} >= 4th elementary symmetric function of {1,2,...,n}.A027921
a(n) = least k such that 3rd elementary symmetric function of {1,2,...,k} >= 4th elementary symmetric function of {1,2,...,n}.
Least k such that 1+2+...+k >= 1^2 + 2^2 + ... + n^2.A027922
Least k such that 1+2+...+k >= 1^2 + 2^2 + ... + n^2.
a(n) = least k such that E{1,2,...,k} >= 1^2 + 2^2 + ... + n^2, where E = 2nd elementary symmetric function.A027923
a(n) = least k such that E{1,2,...,k} >= 1^2 + 2^2 + ... + n^2, where E = 2nd elementary symmetric function.
a(n) = least k such that 1+2+...+k >= 1^3 + 2^3 + ... + n^3.A027924
a(n) = least k such that 1+2+...+k >= 1^3 + 2^3 + ... + n^3.
a(n) = least k such that E{1,2,...,k} >= 1^3 + 2^3 + ... + n^3, where E = 2nd elementary symmetric function.A027925
a(n) = least k such that E{1,2,...,k} >= 1^3 + 2^3 + ... + n^3, where E = 2nd elementary symmetric function.
Triangular array T read by rows: T(n,0) = T(n,2n) = 1 for n >= 0; T(n,1) = 1 for n >= 1; T(n,k) = T(n-1,k-2) + T(n-1,k-1) for k = 2..2n-1, n >= 2.A027926
Triangular array T read by rows: T(n,0) = T(n,2n) = 1 for n >= 0; T(n,1) = 1 for n >= 1; T(n,k) = T(n-1,k-2) + T(n-1,k-1) for k = 2..2n-1, n >= 2.
Number of plane regions after drawing (in general position) a convex n-gon and all its diagonals.A027927
Number of plane regions after drawing (in general position) a convex n-gon and all its diagonals.
a(n) = T(n, 2*n-5), T given by A027926.A027928
a(n) = T(n, 2*n-5), T given by A027926.
a(n) = T(n, 2*n-6), T given by A027926.A027929
a(n) = T(n, 2*n-6), T given by A027926.
a(n) = T(n, 2*n-7), T given by A027926.A027930
a(n) = T(n, 2*n-7), T given by A027926.
T(n, 2n-8), T given by A027926.A027931
T(n, 2n-8), T given by A027926.
T(n, 2n-9), T given by A027926.A027932
T(n, 2n-9), T given by A027926.
a(n) = T(n, 2*n-10), T given by A027926.A027933
a(n) = T(n, 2*n-10), T given by A027926.
a(0)=0, a(1)=1, a(2)=2; for n > 2, a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3).A027934
a(0)=0, a(1)=1, a(2)=2; for n > 2, a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3).
Triangular array T read by rows: T(n,k)=t(n,2k), t given by A027926; 0 <= k <= n, n >= 0.A027935
Triangular array T read by rows: T(n,k)=t(n,2k), t given by A027926; 0 <= k <= n, n >= 0.
Uniquification of array T given by A027935.A027936
Uniquification of array T given by A027935.
a(n) = T(2*n, n+1), T given by A027935.A027937
a(n) = T(2*n, n+1), T given by A027935.
a(n) = T(2n, n+2), T given by A027935.A027938
a(n) = T(2n, n+2), T given by A027935.
a(n) = T(2*n, n+3), T given by A027935.A027939
a(n) = T(2*n, n+3), T given by A027935.
a(n) = T(2*n, n+4), T given by A027935.A027940
a(n) = T(2*n, n+4), T given by A027935.
a(n) = Fibonacci(2*n + 1) - 1.A027941
a(n) = Fibonacci(2*n + 1) - 1.
a(n) = T(2n+1, n+2), T given by A027935.A027942
a(n) = T(2n+1, n+2), T given by A027935.
a(n) = T(2*n+1, n+3), T given by A027935.A027943
a(n) = T(2*n+1, n+3), T given by A027935.
a(n) = T(2n+1, n+4), T given by A027935.A027944
a(n) = T(2n+1, n+4), T given by A027935.
Greatest number in row n of array T given by A027935.A027945
Greatest number in row n of array T given by A027935.
a(n) is the sum of the non-Fibonacci numbers in row n of array T given by A027935, computed as T(n,m) + T(n,m+1) + ... + T(n,n-1), where m = floor((n+2)/2).A027946
a(n) is the sum of the non-Fibonacci numbers in row n of array T given by A027935, computed as T(n,m) + T(n,m+1) + ... + T(n,n-1), where m = floor((n+2)/2).
a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027935.A027947
a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027935.
Triangular array T read by rows: T(n,k) = t(n,2k+1) for 0 <= k <= n, T(n,n)=1, t given by A027926, n >= 0.A027948
Triangular array T read by rows: T(n,k) = t(n,2k+1) for 0 <= k <= n, T(n,n)=1, t given by A027926, n >= 0.
a(n) = T(2n,n+1), T given by A027948.A027949
a(n) = T(2n,n+1), T given by A027948.
a(n) = T(2n,n+2), T given by A027948.A027950
a(n) = T(2n,n+2), T given by A027948.
a(n) = T(2n,n+3), T given by A027948.A027951
a(n) = T(2n,n+3), T given by A027948.
a(n) = T(2n,n+4), T given by A027948.A027952
a(n) = T(2n,n+4), T given by A027948.
a(0)=1, a(n) = Fibonacci(2n+4) - (2n+3).A027953
a(0)=1, a(n) = Fibonacci(2n+4) - (2n+3).
a(n) = T(2n+1, n+2), T given by A027948.A027954
a(n) = T(2n+1, n+2), T given by A027948.
a(n) = T(2n+1, n+3), T given by A027948.A027955
a(n) = T(2n+1, n+3), T given by A027948.
a(n) = T(2n+1, n+4), T given by A027948.A027956
a(n) = T(2n+1, n+4), T given by A027948.
a(n) = greatest number in row n of array T given by A027948.A027957
a(n) = greatest number in row n of array T given by A027948.
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m = floor((n+2)/2), T given by A027948.A027958
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m = floor((n+2)/2), T given by A027948.
a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027948.A027959
a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027948.
'Lucas array': triangular array T read by rows.A027960
'Lucas array': triangular array T read by rows.