Sequences
392,541 sequences
- T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.A050161
T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.
- T(n,k)=S(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.A050162
T(n,k)=S(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.
- T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157.A050163
T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157.
- T(n,k)=S(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array S as in A050157.A050164
T(n,k)=S(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array S as in A050157.
- Triangle read by rows: T(n,k) = M(2n+1,k,-1), 0 <= k <= n, n >= 0, array M as in A050144.A050165
Triangle read by rows: T(n,k) = M(2n+1,k,-1), 0 <= k <= n, n >= 0, array M as in A050144.
- Triangle T(n,k) = M(2n,k,-1), with 0 <= k <= n, n >= 0, and array M is defined in A050144.A050166
Triangle T(n,k) = M(2n,k,-1), with 0 <= k <= n, n >= 0, and array M is defined in A050144.
- T(n,k)=M(n,k,f(n,k)), 0<=k<=n, n >= 0, array M as in A050144 and f(n,k)=least number t for which M(n,k,t) is not 0.A050167
T(n,k)=M(n,k,f(n,k)), 0<=k<=n, n >= 0, array M as in A050144 and f(n,k)=least number t for which M(n,k,t) is not 0.
- a(0) = 1; for n > 0, a(n) = binomial(n, floor(n/2)) + binomial(n-1, floor(n/2)).A050168
a(0) = 1; for n > 0, a(n) = binomial(n, floor(n/2)) + binomial(n-1, floor(n/2)).
- Triangle read by rows: T(n,k) = gcd(C(n,k), C(n,k-1)), n >= 1, 1 <= k <= n.A050169
Triangle read by rows: T(n,k) = gcd(C(n,k), C(n,k-1)), n >= 1, 1 <= k <= n.
- a(1) = 1, a(n) = floor(a(n-1)/sqrt(5)) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = floor(a(n-1)*sqrt(5)).A050170
a(1) = 1, a(n) = floor(a(n-1)/sqrt(5)) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = floor(a(n-1)*sqrt(5)).
- a(n)=least k satisfying a(k)=n in A050170.A050171
a(n)=least k satisfying a(k)=n in A050170.
- Numbers k such that b(k) < b(k+1), where b = A050170.A050172
Numbers k such that b(k) < b(k+1), where b = A050170.
- Numbers k such that A050170(k) > A050170(k+1).A050173
Numbers k such that A050170(k) > A050170(k+1).
- T(n,k) = S(n,k,k-2), 1<=k<=n-2, n >= 3, array S as in A050157.A050174
T(n,k) = S(n,k,k-2), 1<=k<=n-2, n >= 3, array S as in A050157.
- T(n,k)=S(n,k,k-3), 2<=k<=n-3, n >= 5, array S as in A050157.A050175
T(n,k)=S(n,k,k-3), 2<=k<=n-3, n >= 5, array S as in A050157.
- T(n,k) = M0(n+1,k,f(n,k)), where M0(p,q,r) is the number of upright paths from (0,0) to (1,0) to (p,p-q) that meet the line y = x-r and do not rise above it and f(n,k) is the least t such that M0(n+1,k,f) is not 0.A050176
T(n,k) = M0(n+1,k,f(n,k)), where M0(p,q,r) is the number of upright paths from (0,0) to (1,0) to (p,p-q) that meet the line y = x-r and do not rise above it and f(n,k) is the least t such that M0(n+1,k,f) is not 0.
- T(n,k)=M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the next-to-least t for which M0(n,k,t) is not 0.A050177
T(n,k)=M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the next-to-least t for which M0(n,k,t) is not 0.
- T(n,k)=M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the 3rd-from-least t for which M0(n,k,t) is not 0.A050178
T(n,k)=M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the 3rd-from-least t for which M0(n,k,t) is not 0.
- T(n,k) = M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the 4th-from-least t for which M0(n,k,t) is not 0.A050179
T(n,k) = M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the 4th-from-least t for which M0(n,k,t) is not 0.
- Numbers m such that prime(m) + Fibonacci(m) is prime.A050180
Numbers m such that prime(m) + Fibonacci(m) is prime.
- T(2n+3, n), array T as in A051168; a count of Lyndon words.A050181
T(2n+3, n), array T as in A051168; a count of Lyndon words.
- a(n) = T(2*n+4, n), array T as in A051168 (a count of Lyndon words).A050182
a(n) = T(2*n+4, n), array T as in A051168 (a count of Lyndon words).
- T(2n+5,n), array T as in A051168; a count of Lyndon words.A050183
T(2n+5,n), array T as in A051168; a count of Lyndon words.
- T(2n+6,n), array T as in A051168; a count of Lyndon words.A050184
T(2n+6,n), array T as in A051168; a count of Lyndon words.
- T(2n+7,n), array T as in A051168; a count of Lyndon words.A050185
T(2n+7,n), array T as in A051168; a count of Lyndon words.
- Triangular array T read by rows: T(h,k) = number of binary words of k 1's and h-k 0's which are not a juxtaposition of 2 or more identical subwords.A050186
Triangular array T read by rows: T(h,k) = number of binary words of k 1's and h-k 0's which are not a juxtaposition of 2 or more identical subwords.
- a(n) = n * floor((n-1)/2).A050187
a(n) = n * floor((n-1)/2).
- T(n,3), array T as in A050186; a count of aperiodic binary words.A050188
T(n,3), array T as in A050186; a count of aperiodic binary words.
- T(n,4), array T as in A050186; a count of aperiodic binary words.A050189
T(n,4), array T as in A050186; a count of aperiodic binary words.
- T(n,5), array T as in A050186; a count of aperiodic binary words.A050190
T(n,5), array T as in A050186; a count of aperiodic binary words.
- T(n,6), array T as in A050186; a count of aperiodic binary words.A050191
T(n,6), array T as in A050186; a count of aperiodic binary words.
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/2) if n is even, else d=0; 2 initial terms.A050192
a(n)=a(n-1)+a(n-2)-d, where d=a(n/2) if n is even, else d=0; 2 initial terms.
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/3) if 3 divides n, else d=0; 2 initial terms.A050193
a(n)=a(n-1)+a(n-2)-d, where d=a(n/3) if 3 divides n, else d=0; 2 initial terms.
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/4) if 4 divides n, else d=0; 2 initial terms.A050194
a(n)=a(n-1)+a(n-2)-d, where d=a(n/4) if 4 divides n, else d=0; 2 initial terms.
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/5) if 5 divides n, else d=0; 2 initial terms.A050195
a(n)=a(n-1)+a(n-2)-d, where d=a(n/5) if 5 divides n, else d=0; 2 initial terms.
- a(1) = 1, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = a(n-1) + a(n-2).A050196
a(1) = 1, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = a(n-1) + a(n-2).
- a(n) = least k satisfying a(k) = n in A050196.A050197
a(n) = least k satisfying a(k) = n in A050196.
- Numbers k such that A050196(k) < A050196(k+1).A050198
Numbers k such that A050196(k) < A050196(k+1).
- Numbers k such that A050196(k) > A050196(k+1).A050199
Numbers k such that A050196(k) > A050196(k+1).
- Let p = prime(n). Then a(n) = p + (next prime >= p+1) + (next prime >= p+3).A050200
Let p = prime(n). Then a(n) = p + (next prime >= p+1) + (next prime >= p+3).
- Starting positions of strings of 2 0's in the decimal expansion of Pi.A050201
Starting positions of strings of 2 0's in the decimal expansion of Pi.
- Starting positions of strings of 3 0's in the decimal expansion of Pi.A050202
Starting positions of strings of 3 0's in the decimal expansion of Pi.
- a(n) is the coefficient of the term a^(-n) in the asymptotic series for the least positive zero of the generalized Rogers-Ramanujan continued fraction.A050203
a(n) is the coefficient of the term a^(-n) in the asymptotic series for the least positive zero of the generalized Rogers-Ramanujan continued fraction.
- a(n) is the number of n X n matrices of 0's, 1's and -1's in which the entries in each row or column sum to 1.A050204
a(n) is the number of n X n matrices of 0's, 1's and -1's in which the entries in each row or column sum to 1.
- Triangle read by rows: number of terms in unit fraction representation of k/n using the greedy algorithm, 1<=k<=n-1.A050205
Triangle read by rows: number of terms in unit fraction representation of k/n using the greedy algorithm, 1<=k<=n-1.
- Triangle read by rows: smallest denominator of the expansion of k/n using the greedy algorithm, 1<=k<=n-1.A050206
Triangle read by rows: smallest denominator of the expansion of k/n using the greedy algorithm, 1<=k<=n-1.
- Primes of the form p + (smallest prime >= p+1) + (smallest prime >= p+3) where p is a prime.A050207
Primes of the form p + (smallest prime >= p+1) + (smallest prime >= p+3) where p is a prime.
- Starting positions of strings of 2 1's in the decimal expansion of Pi.A050208
Starting positions of strings of 2 1's in the decimal expansion of Pi.
- Starting positions of strings of 3 1's in the decimal expansion of Pi.A050209
Starting positions of strings of 3 1's in the decimal expansion of Pi.
- Largest denominator in unit fraction representation of triangle of numbers 1/2, 1/3, 2/3, 1/4, 2/4, ... as computed with greedy algorithm.A050210
Largest denominator in unit fraction representation of triangle of numbers 1/2, 1/3, 2/3, 1/4, 2/4, ... as computed with greedy algorithm.