Sequences
392,541 sequences
- a(n) = Lucas(n+2) - 3.A027961
a(n) = Lucas(n+2) - 3.
- Duplicate of A023537.A027962
Duplicate of A023537.
- T(n,n+3), T given by A027960.A027963
T(n,n+3), T given by A027960.
- T(n,n+4), T given by A027960.A027964
T(n,n+4), T given by A027960.
- T(n, 2*n-3), T given by A027960.A027965
T(n, 2*n-3), T given by A027960.
- T(n, 2*n-4), T given by A027960.A027966
T(n, 2*n-4), T given by A027960.
- T(n, 2*n-5), T given by A027960.A027967
T(n, 2*n-5), T given by A027960.
- a(n) = T(n, 2*n-6), T given by A027960.A027968
a(n) = T(n, 2*n-6), T given by A027960.
- a(n) = T(n, 2*n-7), T given by A027960.A027969
a(n) = T(n, 2*n-7), T given by A027960.
- a(n) = T(n, 2*n-8), T given by A027960.A027970
a(n) = T(n, 2*n-8), T given by A027960.
- T(n, 2n-9), T given by A027960.A027971
T(n, 2n-9), T given by A027960.
- T(n, 2n-10), T given by A027960.A027972
T(n, 2n-10), T given by A027960.
- a(n) = T(n,n) + T(n,n+1) + ... + T(n,2n), T given by A027960.A027973
a(n) = T(n,n) + T(n,n+1) + ... + T(n,2n), T given by A027960.
- a(n) = Sum_{k=1..n+1} A027960(n+1, n+1+k).A027974
a(n) = Sum_{k=1..n+1} A027960(n+1, n+1+k).
- a(n) is the n-th diagonal sum of left justified array T given by A027960.A027975
a(n) is the n-th diagonal sum of left justified array T given by A027960.
- n-th diagonal sum of right justified array T given by A027960.A027976
n-th diagonal sum of right justified array T given by A027960.
- a(n) = greatest number in row n of array T given by A027960.A027977
a(n) = greatest number in row n of array T given by A027960.
- a(n) = self-convolution of row n of array T given by A027960.A027978
a(n) = self-convolution of row n of array T given by A027960.
- a(n) = Sum_{k=0..n} T(n,k)*T(n,2n-k), T given by A027960.A027979
a(n) = Sum_{k=0..n} T(n,k)*T(n,2n-k), T given by A027960.
- a(n) = Sum_{k=0..n-1} T(n,k)*T(n,2n-k), T given by A027960.A027980
a(n) = Sum_{k=0..n-1} T(n,k)*T(n,2n-k), T given by A027960.
- a(n) = Sum_{k=0..2*n} (k+1)*T(n,k), T given by A027960.A027981
a(n) = Sum_{k=0..2*n} (k+1)*T(n,k), T given by A027960.
- a(n) = Sum_{k=0..2*n} (k+1)*T(n, 2*n-k), T given by A027960.A027982
a(n) = Sum_{k=0..2*n} (k+1)*T(n, 2*n-k), T given by A027960.
- Duplicate of A027974.A027983
Duplicate of A027974.
- a(n) = Sum_{k=0..n} T(n, k)*T(n, n+k), T given by A027960.A027984
a(n) = Sum_{k=0..n} T(n, k)*T(n, n+k), T given by A027960.
- a(n) = Sum_{k=0..2*n-1} T(n, k)*T(n, k+1), T given by A027960.A027985
a(n) = Sum_{k=0..2*n-1} T(n, k)*T(n, k+1), T given by A027960.
- a(n) = Sum_{k=0..2*n-2} T(n, k)*T(n, k+2), T given by A027960.A027986
a(n) = Sum_{k=0..2*n-2} T(n, k)*T(n, k+2), T given by A027960.
- a(n) = Sum_{k=0..2*n-3} T(n, k)*T(n, k+3), T given by A027960.A027987
a(n) = Sum_{k=0..2*n-3} T(n, k)*T(n, k+3), T given by A027960.
- Greatest number in row n of array T given by A027926.A027988
Greatest number in row n of array T given by A027926.
- a(n) = self-convolution of row n of array T given by A027926.A027989
a(n) = self-convolution of row n of array T given by A027926.
- Sum{T(n,k)*T(n,2n-k)}, 0<=k<=n, T given by A027926.A027990
Sum{T(n,k)*T(n,2n-k)}, 0<=k<=n, T given by A027926.
- a(n) = Sum{T(n,k)*T(n,2n-k)}, 0<=k<=n-1, T given by A027926.A027991
a(n) = Sum{T(n,k)*T(n,2n-k)}, 0<=k<=n-1, T given by A027926.
- a(n) = 1*T(n,0) + 2*T(n,1) + ... + (2n+1)*T(n,2n), T given by A027926.A027992
a(n) = 1*T(n,0) + 2*T(n,1) + ... + (2n+1)*T(n,2n), T given by A027926.
- a(n) = 1*T(n,2n) + 2*T(n,2n-1) + ... + (2n+1)*T(n,0), T given by A027926.A027993
a(n) = 1*T(n,2n) + 2*T(n,2n-1) + ... + (2n+1)*T(n,0), T given by A027926.
- a(n) = (F(2n+3) - F(n))/2 where F() = Fibonacci numbers A000045.A027994
a(n) = (F(2n+3) - F(n))/2 where F() = Fibonacci numbers A000045.
- a(n) = Sum_{k=0..2n-1} T(n,k)*T(n,k+1), T given by A027926.A027995
a(n) = Sum_{k=0..2n-1} T(n,k)*T(n,k+1), T given by A027926.
- a(n)=Sum{T(n,k)*T(n,k+2)}, 0<=k<=2n-2, T given by A027926.A027996
a(n)=Sum{T(n,k)*T(n,k+2)}, 0<=k<=2n-2, T given by A027926.
- Sum{T(n,k)*T(n,k+3)}, 0<=k<=2n-3, T given by A027926.A027997
Sum{T(n,k)*T(n,k+3)}, 0<=k<=2n-3, T given by A027926.
- Expansion of Product_{m>=1} (1+q^m)^(m^2).A027998
Expansion of Product_{m>=1} (1+q^m)^(m^2).
- Expansion of Product(1+q^m)^(m(m-1)/2); m=1..inf.A027999
Expansion of Product(1+q^m)^(m(m-1)/2); m=1..inf.
- Expansion of 1/((1-2*x)*(1-6*x)*(1-9*x)*(1-11*x)).A028000
Expansion of 1/((1-2*x)*(1-6*x)*(1-9*x)*(1-11*x)).
- Expansion of 1/((1-2x)(1-6x)(1-9x)(1-12x)).A028001
Expansion of 1/((1-2x)(1-6x)(1-9x)(1-12x)).
- Expansion of 1/((1-2*x)*(1-6*x)*(1-10*x)*(1-11*x)).A028002
Expansion of 1/((1-2*x)*(1-6*x)*(1-10*x)*(1-11*x)).
- Expansion of 1/((1-2x)(1-6x)(1-10x)(1-12x)).A028003
Expansion of 1/((1-2x)(1-6x)(1-10x)(1-12x)).
- Expansion of 1/((1-2x)(1-6x)(1-11x)(1-12x)).A028004
Expansion of 1/((1-2x)(1-6x)(1-11x)(1-12x)).
- Expansion of 1/((1-2x)(1-7x)(1-8x)(1-9x)).A028005
Expansion of 1/((1-2x)(1-7x)(1-8x)(1-9x)).
- Expansion of 1/((1-2x)(1-7x)(1-8x)(1-10x)).A028006
Expansion of 1/((1-2x)(1-7x)(1-8x)(1-10x)).
- Expansion of 1/((1-2x)(1-7x)(1-8x)(1-11x)).A028007
Expansion of 1/((1-2x)(1-7x)(1-8x)(1-11x)).
- Expansion of 1/((1-2x)(1-7x)(1-8x)(1-12x)).A028008
Expansion of 1/((1-2x)(1-7x)(1-8x)(1-12x)).
- Expansion of 1/((1-2x)(1-7x)(1-9x)(1-10x)).A028009
Expansion of 1/((1-2x)(1-7x)(1-9x)(1-10x)).
- Expansion of 1/((1-2x)(1-7x)(1-9x)(1-11x)).A028010
Expansion of 1/((1-2x)(1-7x)(1-9x)(1-11x)).