Sequences
392,541 sequences
- Row sums of array T as in A054110.A054111
Row sums of array T as in A054110.
- T(n,n-3), array T as in A054110.A054112
T(n,n-3), array T as in A054110.
- T(2*n,n), array T as in A054110.A054113
T(2*n,n), array T as in A054110.
- T(2n+1,n), array T as in A054110.A054114
T(2n+1,n), array T as in A054110.
- Triangular array generated by its row sums: T(n,0)=1 for n >= 1, T(n,1)=r(n-1), T(n,k)=T(n,k-1)+r(n-k) for k=2,3,...,n, n >= 2, r(h)=sum of the numbers in row h of T.A054115
Triangular array generated by its row sums: T(n,0)=1 for n >= 1, T(n,1)=r(n-1), T(n,k)=T(n,k-1)+r(n-k) for k=2,3,...,n, n >= 2, r(h)=sum of the numbers in row h of T.
- T(n,n-1), array T as in A054115.A054116
T(n,n-1), array T as in A054115.
- T(n,n-2), array T as in A054115.A054117
T(n,n-2), array T as in A054115.
- Subdiagonal T(n,n-3), array T as in A054115.A054118
Subdiagonal T(n,n-3), array T as in A054115.
- a(n) = n! + (n-1)! + (n-2)!.A054119
a(n) = n! + (n-1)! + (n-2)!.
- Triangular array T(n,k): start with T(n,0)=T(n,n)=1 for n >= 0; recursively, draw vertical lines through T(n-1,k-1) if present and T(n-1,k) if present; then T(n,k) is the sum of T(i,j) that lie on or between the lines and not below T(n,k).A054120
Triangular array T(n,k): start with T(n,0)=T(n,n)=1 for n >= 0; recursively, draw vertical lines through T(n-1,k-1) if present and T(n-1,k) if present; then T(n,k) is the sum of T(i,j) that lie on or between the lines and not below T(n,k).
- T(n,n-3), array T as in A054120.A054121
T(n,n-3), array T as in A054120.
- T(2n,n), array T as in A054120.A054122
T(2n,n), array T as in A054120.
- Right Fibonacci row-sum array T(n,k), n >= 0, 0<=k<=n.A054123
Right Fibonacci row-sum array T(n,k), n >= 0, 0<=k<=n.
- Left Fibonacci row-sum array, n >= 0, 0<=k<=n.A054124
Left Fibonacci row-sum array, n >= 0, 0<=k<=n.
- Sum of the arrays in A054123 and A054124.A054125
Sum of the arrays in A054123 and A054124.
- Odd-index Fibonacci row-sum array: T(n,k)=U(2n+1,n+1+k), 0<=k<=n, n >= 0, U the array in A054125.A054126
Odd-index Fibonacci row-sum array: T(n,k)=U(2n+1,n+1+k), 0<=k<=n, n >= 0, U the array in A054125.
- a(1) = 2; a(n) = 9*2^(n-2) - n - 2, n>1.A054127
a(1) = 2; a(n) = 9*2^(n-2) - n - 2, n>1.
- T(n,2), array T as in A054126.A054128
T(n,2), array T as in A054126.
- T(n,3), array T as in A054126.A054129
T(n,3), array T as in A054126.
- T(n,4), array T as in A054126.A054130
T(n,4), array T as in A054126.
- T(2n,n), array T as in A054126.A054131
T(2n,n), array T as in A054126.
- T(2n+1,n), array T as in A054126.A054132
T(2n+1,n), array T as in A054126.
- T(2n-1,n) where T is the array in A054126.A054133
T(2n-1,n) where T is the array in A054126.
- Even-index Fibonacci row-sum array: T(n,0)=U(2n,n)/2, T(n,k)=U(2n,n+k) for k=1,2,...,n, n >= 0, U the array in A054125.A054134
Even-index Fibonacci row-sum array: T(n,0)=U(2n,n)/2, T(n,k)=U(2n,n+k) for k=1,2,...,n, n >= 0, U the array in A054125.
- a(n) = T(n,1), array T as in A054134.A054135
a(n) = T(n,1), array T as in A054134.
- a(n) = T(n,2), array T as in A054134.A054136
a(n) = T(n,2), array T as in A054134.
- T(n,3), array T as in A054134.A054137
T(n,3), array T as in A054134.
- T(n,4), array T as in A054134.A054138
T(n,4), array T as in A054134.
- T(2n,n), array T as in A054134.A054139
T(2n,n), array T as in A054134.
- T(2n+1,n), array T as in A054134.A054140
T(2n+1,n), array T as in A054134.
- T(2n-1,n), array T as in A054134.A054141
T(2n-1,n), array T as in A054134.
- Triangular array binomial(2*n-k, k), k=0..n, n >= 0.A054142
Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
- Triangular array T given by T(n,k) = Sum_{0 <= j <= i-n+k, n-k <= i <= n} C(i,j) for n >= 0 and 0 <= k <= n.A054143
Triangular array T given by T(n,k) = Sum_{0 <= j <= i-n+k, n-k <= i <= n} C(i,j) for n >= 0 and 0 <= k <= n.
- Triangular array T: put T(n,0)=n for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.A054144
Triangular array T: put T(n,0)=n for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.
- Row sums of array T as in A054144.A054145
Row sums of array T as in A054144.
- a(n) = A054145(n)/2.A054146
a(n) = A054145(n)/2.
- a(n) = T(2n,n), array T as in A054144.A054147
a(n) = T(2n,n), array T as in A054144.
- T(2n+1,n), array T as in A054144.A054148
T(2n+1,n), array T as in A054144.
- T(2n-1,n), array T as in A054144.A054149
T(2n-1,n), array T as in A054144.
- Number of positive integers <= 2^n of the form x^2 + 5*y^2.A054150
Number of positive integers <= 2^n of the form x^2 + 5*y^2.
- Number of positive integers <= 2^n of form x^2 + 7 y^2.A054151
Number of positive integers <= 2^n of form x^2 + 7 y^2.
- Number of positive integers <= 2^n of form x^2 + 8 y^2.A054152
Number of positive integers <= 2^n of form x^2 + 8 y^2.
- Number of positive integers <= 2^n of form x^2 + 9 y^2.A054153
Number of positive integers <= 2^n of form x^2 + 9 y^2.
- Moebius transform of A001037 (starting at term 0).A054154
Moebius transform of A001037 (starting at term 0).
- Inverse Moebius transform of A000029 (starting at term 0).A054155
Inverse Moebius transform of A000029 (starting at term 0).
- Moebius transform of A000029 (starting at term 0).A054156
Moebius transform of A000029 (starting at term 0).
- Number of positive integers <= 2^n of form 2 x^2 + 7 y^2.A054157
Number of positive integers <= 2^n of form 2 x^2 + 7 y^2.
- Inverse Moebius transform of A001371 (starting at term 0).A054158
Inverse Moebius transform of A001371 (starting at term 0).
- Number of positive integers <= 2^n of form 2 x^2 + 9 y^2.A054159
Number of positive integers <= 2^n of form 2 x^2 + 9 y^2.
- Moebius transform of A001371 (starting at term 0).A054160
Moebius transform of A001371 (starting at term 0).