Sequences
392,541 sequences
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047110.A047111
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047110.
- T(n,n), array T as in A047110.A047112
T(n,n), array T as in A047110.
- T(n,n-1), array T as in A047110.A047113
T(n,n-1), array T as in A047110.
- T(n,n-2), array T as in A047110.A047114
T(n,n-2), array T as in A047110.
- T(n,n-3), array T as in A047110.A047115
T(n,n-3), array T as in A047110.
- T(n,n+1), array T as in A047110.A047116
T(n,n+1), array T as in A047110.
- T(n,n+2), array T as in A047110.A047117
T(n,n+2), array T as in A047110.
- T(n,n+3), array T as in A047110.A047118
T(n,n+3), array T as in A047110.
- T(2n,n), array T as in A047110.A047119
T(2n,n), array T as in A047110.
- 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/4 only at lattice points.A047120
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/4 only at lattice points.
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047120.A047121
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047120.
- T(n,n), array T as in A047120.A047122
T(n,n), array T as in A047120.
- T(n,n-1), array T as in A047120.A047123
T(n,n-1), array T as in A047120.
- T(n,n-2), array T as in A047120.A047124
T(n,n-2), array T as in A047120.
- T(n,n-3), array T as in A047120.A047125
T(n,n-3), array T as in A047120.
- T(n,n+1), array T as in A047120.A047126
T(n,n+1), array T as in A047120.
- T(n,n+2), array T as in A047120.A047127
T(n,n+2), array T as in A047120.
- T(n,n+3), array T as in A047120.A047128
T(n,n+3), array T as in A047120.
- T(2n,n), array T as in A047120.A047129
T(2n,n), array T as in A047120.
- Array read by descending antidiagonals: T(h,k) is the 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 = 3x/4. (Thus a path crosses the line only at lattice points and on right-steps.)A047130
Array read by descending antidiagonals: T(h,k) is the 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 = 3x/4. (Thus a path crosses the line only at lattice points and on right-steps.)
- a(n) = Sum_{i=0..n} A047130(i, n-i).A047131
a(n) = Sum_{i=0..n} A047130(i, n-i).
- T(n,n), array T as in A047130.A047132
T(n,n), array T as in A047130.
- T(n,n-1), array T as in A047130.A047133
T(n,n-1), array T as in A047130.
- T(n,n-2), array T as in A047130.A047134
T(n,n-2), array T as in A047130.
- a(n) = T(n,n-3), array T as in A047130.A047135
a(n) = T(n,n-3), array T as in A047130.
- a(n) = T(n,n+1), array T as in A047130.A047136
a(n) = T(n,n+1), array T as in A047130.
- a(n) = T(n,n+2), array T as in A047130.A047137
a(n) = T(n,n+2), array T as in A047130.
- a(n) = T(n,n+3), array T as in A047130.A047138
a(n) = T(n,n+3), array T as in A047130.
- T(2n,n), array T as in A047130.A047139
T(2n,n), array T as in A047130.
- 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=4x/3. (Thus a path crosses the line only at lattice points and on right-steps.).A047140
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=4x/3. (Thus a path crosses the line only at lattice points and on right-steps.).
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047140.A047141
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047140.
- T(n,n), array T as in A047140.A047142
T(n,n), array T as in A047140.
- T(n,n-1), array T as in A047140.A047143
T(n,n-1), array T as in A047140.
- T(n,n-2), array T as in A047140.A047144
T(n,n-2), array T as in A047140.
- T(n,n-3), array T as in A047140.A047145
T(n,n-3), array T as in A047140.
- T(n,n+1), array T as in A047140.A047146
T(n,n+1), array T as in A047140.
- T(n,n+2), array T as in A047140.A047147
T(n,n+2), array T as in A047140.
- T(n,n+3), array T as in A047140.A047148
T(n,n+3), array T as in A047140.
- T(2n,n), array T as in A047140.A047149
T(2n,n), array T as in A047140.
- 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=5x/3. (Thus a path crosses the line only at lattice points and on right-steps.).A047150
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=5x/3. (Thus a path crosses the line only at lattice points and on right-steps.).
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047150.A047151
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047150.
- T(n,n), array T as in A047150.A047152
T(n,n), array T as in A047150.
- T(n,n-1), array T as in A047150.A047153
T(n,n-1), array T as in A047150.
- T(n,n-2), array T as in A047150.A047154
T(n,n-2), array T as in A047150.
- T(n,n-3), array T as in A047150.A047155
T(n,n-3), array T as in A047150.
- T(n,n+1), array T as in A047150.A047156
T(n,n+1), array T as in A047150.
- T(n,n+2), array T as in A047150.A047157
T(n,n+2), array T as in A047150.
- T(n,n+3), array T as in A047150.A047158
T(n,n+3), array T as in A047150.
- T(2n,n), array T as in A047150.A047159
T(2n,n), array T as in A047150.
- For n >= 2, a(n) = smallest number m >= 0 such that n-m and n+m are both primes, or -1 if no such m exists.A047160
For n >= 2, a(n) = smallest number m >= 0 such that n-m and n+m are both primes, or -1 if no such m exists.