Sequences
392,541 sequences
- a(n) = Sum_{i=0..n} A047060(i,n-i).A047061
a(n) = Sum_{i=0..n} A047060(i,n-i).
- T(n,n), array T as in A047060.A047062
T(n,n), array T as in A047060.
- T(n,n-1), array T as in A047060.A047063
T(n,n-1), array T as in A047060.
- T(n,n-2), array T as in A047060.A047064
T(n,n-2), array T as in A047060.
- T(n,n-3), array T as in A047060.A047065
T(n,n-3), array T as in A047060.
- T(n,n+1), array T as in A047060.A047066
T(n,n+1), array T as in A047060.
- T(n,n+2), array T as in A047060.A047067
T(n,n+2), array T as in A047060.
- T(n,n+3), array T as in A047060.A047068
T(n,n+3), array T as in A047060.
- T(2n,n), array T as in A047060.A047069
T(2n,n), array T as in A047060.
- Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=2x unless x=0 or x=h.A047070
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=2x unless x=0 or x=h.
- Array T by antidiagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=3x unless x=0 or x=h.A047071
Array T by antidiagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=3x unless x=0 or x=h.
- Array A read by diagonals: A(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=x unless x=0 or x=h.A047072
Array A read by diagonals: A(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=x unless x=0 or x=h.
- a(n) = Sum_{j=0..n} A047072(j, n-j).A047073
a(n) = Sum_{j=0..n} A047072(j, n-j).
- a(n) = Sum_{i=0..floor(n/2)} T(i,n-i), array T as in A047072.A047074
a(n) = Sum_{i=0..floor(n/2)} T(i,n-i), array T as in A047072.
- All differences C(j)-C(i), j>i, of Catalan numbers A000108.A047075
All differences C(j)-C(i), j>i, of Catalan numbers A000108.
- a(n+1) is the smallest palindromic prime containing exactly 2 more digits on each end than the previous term, with a(n) as a central substring.A047076
a(n+1) is the smallest palindromic prime containing exactly 2 more digits on each end than the previous term, with a(n) as a central substring.
- Number of pairs of integers (x,y) with n^2 <= x^2+y^2 <= (n+1)^2.A047077
Number of pairs of integers (x,y) with n^2 <= x^2+y^2 <= (n+1)^2.
- Primes at which difference pattern X2Y (X and Y >= 6) occurs in A001223.A047078
Primes at which difference pattern X2Y (X and Y >= 6) occurs in A001223.
- a(n) = Sum_{i=0..floor(n/2)} A047072(i, n-2*i).A047079
a(n) = Sum_{i=0..floor(n/2)} A047072(i, n-2*i).
- Triangular array T read by rows: T(h,k)=number of paths from (0,0) to (k,h-k) using step-vectors (0,1), (1,0), (1,1) with no right angles between pairs of consecutive steps.A047080
Triangular array T read by rows: T(h,k)=number of paths from (0,0) to (k,h-k) using step-vectors (0,1), (1,0), (1,1) with no right angles between pairs of consecutive steps.
- a(n) = Sum_{k=0..n} T(n, k), array T as in A047080.A047081
a(n) = Sum_{k=0..n} T(n, k), array T as in A047080.
- a(n) = Sum_{i=0..floor(n/2)} A047080(n,i).A047082
a(n) = Sum_{i=0..floor(n/2)} A047080(n,i).
- a(n) = Sum_{i=0..floor((n+1)/2)} A047080(n,i).A047083
a(n) = Sum_{i=0..floor((n+1)/2)} A047080(n,i).
- a(n) = Sum_{i=0..n} A047080(i,n-i).A047084
a(n) = Sum_{i=0..n} A047080(i,n-i).
- a(n) = T(2*n, n), array T as in A047080.A047085
a(n) = T(2*n, n), array T as in A047080.
- a(n) = T(2*n+1, n), array T as in A047080.A047086
a(n) = T(2*n+1, n), array T as in A047080.
- a(n) = A047080(2*n, n+1).A047087
a(n) = A047080(2*n, n+1).
- a(n) = A047080(2*n+1, n+2).A047088
a(n) = A047080(2*n+1, n+2).
- Array T read by antidiagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and touches the line y=x/2 only at lattice points.A047089
Array T read by antidiagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and touches the line y=x/2 only at lattice points.
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047089.A047090
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047089.
- T(n,n), array T as in A047089.A047091
T(n,n), array T as in A047089.
- T(n,n-1), array T as in A047089.A047092
T(n,n-1), array T as in A047089.
- T(n,n-2), array T as in A047089.A047093
T(n,n-2), array T as in A047089.
- T(n,n-3), array T as in A047089.A047094
T(n,n-3), array T as in A047089.
- T(n,n+1), array T as in A047089.A047095
T(n,n+1), array T as in A047089.
- T(n,n+2), array T as in A047089.A047096
T(n,n+2), array T as in A047089.
- T(n,n+3), array T as in A047089.A047097
T(n,n+3), array T as in A047089.
- a(n) = 2*binomial(3*n, n) - Sum_{k=0..n} binomial(3*n, k).A047098
a(n) = 2*binomial(3*n, n) - Sum_{k=0..n} binomial(3*n, k).
- a(n) = A047098(n)/2.A047099
a(n) = A047098(n)/2.
- Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and touches the line y=x/3 only at lattice points.A047100
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and touches the line y=x/3 only at lattice points.
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047100.A047101
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047100.
- T(n,n), array T as in A047100.A047102
T(n,n), array T as in A047100.
- T(n,n-1), array T as in A047100.A047103
T(n,n-1), array T as in A047100.
- T(n,n-2), array T as in A047100.A047104
T(n,n-2), array T as in A047100.
- T(n,n-3), array T as in A047100.A047105
T(n,n-3), array T as in A047100.
- T(n,n+1), array T as in A047100.A047106
T(n,n+1), array T as in A047100.
- T(n,n+2), array T as in A047100.A047107
T(n,n+2), array T as in A047100.
- T(n,n+3), array T as in A047100.A047108
T(n,n+3), array T as in A047100.
- T(2n,n), array T as in A047100.A047109
T(2n,n), array T as in A047100.
- Array read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no up-step crosses the line y=2x/3. (Thus a path crosses the line only at lattice points and on right-steps.).A047110
Array read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no up-step crosses the line y=2x/3. (Thus a path crosses the line only at lattice points and on right-steps.).