Sequences
392,541 sequences
- Numbers k such that A050108(k) > A050108(k+1).A050111
Numbers k such that A050108(k) > A050108(k+1).
- a(n) = floor(a(n-1)/4) if this is positive and not yet in the sequence, otherwise a(n) = 6*a(n-1).A050112
a(n) = floor(a(n-1)/4) if this is positive and not yet in the sequence, otherwise a(n) = 6*a(n-1).
- a(n) = position of n in A050112.A050113
a(n) = position of n in A050112.
- Numbers k such that A050112(k) < A050112(k+1).A050114
Numbers k such that A050112(k) < A050112(k+1).
- Numbers k such that A050112(k) > A050112(k+1).A050115
Numbers k such that A050112(k) > A050112(k+1).
- Numbers that are the product of two distinct Lucas numbers.A050116
Numbers that are the product of two distinct Lucas numbers.
- a(n) = b(n)-b(n-1), where b=A050116 (ordered products of Lucas numbers).A050117
a(n) = b(n)-b(n-1), where b=A050116 (ordered products of Lucas numbers).
- Numbers that are the product of two Lucas numbers.A050118
Numbers that are the product of two Lucas numbers.
- a(n)=b(n)-b(n-1), where b=A050118 (ordered products of Lucas numbers).A050119
a(n)=b(n)-b(n-1), where b=A050118 (ordered products of Lucas numbers).
- Numbers of the form Fibonacci(i)*Lucas(j), 0 <= i < j.A050120
Numbers of the form Fibonacci(i)*Lucas(j), 0 <= i < j.
- a(n)=b(n)-b(n-1), where b=A050120 (ordered products of Fibonacci and Lucas numbers).A050121
a(n)=b(n)-b(n-1), where b=A050120 (ordered products of Fibonacci and Lucas numbers).
- Numbers of the form Fibonacci(i)*Lucas(j), i <= j.A050122
Numbers of the form Fibonacci(i)*Lucas(j), i <= j.
- a(n) = b(n)-b(n-1), where b=A050122 (ordered products of Fibonacci and Lucas numbers).A050123
a(n) = b(n)-b(n-1), where b=A050122 (ordered products of Fibonacci and Lucas numbers).
- a(1)=1; for n > 1, a(n) = floor(a(n-1)/5) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 2*a(n-1).A050124
a(1)=1; for n > 1, a(n) = floor(a(n-1)/5) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 2*a(n-1).
- a(n)=position of n in A050124.A050125
a(n)=position of n in A050124.
- Numbers k such that A050124(k) < A050124(k+1).A050126
Numbers k such that A050124(k) < A050124(k+1).
- Numbers k such that A050124(k) > A050124(k+1).A050127
Numbers k such that A050124(k) > A050124(k+1).
- a(n) = floor(a(n-1)/2) if this is not among 0, a(1), ..., a(n-1); otherwise a(n) = 2*n.A050128
a(n) = floor(a(n-1)/2) if this is not among 0, a(1), ..., a(n-1); otherwise a(n) = 2*n.
- a(n) is the least k satisfying A050128(k) = n.A050129
a(n) is the least k satisfying A050128(k) = n.
- a(n)=least k satisfying a(k)=2*k in A050128.A050130
a(n)=least k satisfying a(k)=2*k in A050128.
- Numbers k such that A050128(k) < A050128(k+1).A050131
Numbers k such that A050128(k) < A050128(k+1).
- a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 3*n.A050132
a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 3*n.
- a(n)=least k satisfying a(k)=n in A050132.A050133
a(n)=least k satisfying a(k)=n in A050132.
- a(n)=least k satisfying a(k)=3*k in A050132.A050134
a(n)=least k satisfying a(k)=3*k in A050132.
- a(1) = 1, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 4*n.A050135
a(1) = 1, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 4*n.
- a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1), otherwise a(n)=5*n.A050136
a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1), otherwise a(n)=5*n.
- a(1)=2; a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 2*n.A050137
a(1)=2; a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 2*n.
- a(1)=2, a(2)=6. For n >= 2, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 3*n.A050138
a(1)=2, a(2)=6. For n >= 2, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 3*n.
- a(1)=2; for n > 1, a(n) = floor(a(n-1)/2) if this is not among 0, a(1), ..., a(n-1); otherwise a(n) = 4*n.A050139
a(1)=2; for n > 1, a(n) = floor(a(n-1)/2) if this is not among 0, a(1), ..., a(n-1); otherwise a(n) = 4*n.
- a(n) = 2*floor(n*phi)-n, where phi = (1+sqrt(5))/2.A050140
a(n) = 2*floor(n*phi)-n, where phi = (1+sqrt(5))/2.
- a(n) = 2*floor((n+1)*phi) - 2*floor(n*phi) - 1 where phi = (1 + sqrt(5))/2 is the golden ratio.A050141
a(n) = 2*floor((n+1)*phi) - 2*floor(n*phi) - 1 where phi = (1 + sqrt(5))/2 is the golden ratio.
- Square array T(n,k) giving maximal numbers of codewords in mixed code with n binary coordinates and k ternary coordinates with Hamming distance 3, read by antidiagonals (n >= 0, k >= 0).A050142
Square array T(n,k) giving maximal numbers of codewords in mixed code with n binary coordinates and k ternary coordinates with Hamming distance 3, read by antidiagonals (n >= 0, k >= 0).
- A(n,k) = Sum_{h=0..n-1, m=0..k} A(h,m) for n >= 1 and k >= 1, with A(n,0) = 1 for n >= 0 and A(0,k) = 0 for k >= 1; square array A, read by descending antidiagonals.A050143
A(n,k) = Sum_{h=0..n-1, m=0..k} A(h,m) for n >= 1 and k >= 1, with A(n,0) = 1 for n >= 0 and A(0,k) = 0 for k >= 1; square array A, read by descending antidiagonals.
- T(n,k) = M(2n-1,n-1,k-1), 0 <= k <= n, n >= 0, where M(p,q,r) is the number of upright paths from (0,0) to (p,p-q) that meet the line y = x+r and do not rise above it.A050144
T(n,k) = M(2n-1,n-1,k-1), 0 <= k <= n, n >= 0, where M(p,q,r) is the number of upright paths from (0,0) to (p,p-q) that meet the line y = x+r and do not rise above it.
- T(n,k)=M(2n,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.A050145
T(n,k)=M(2n,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.
- a(n) = T(n,n), array T as in A050143.A050146
a(n) = T(n,n), array T as in A050143.
- a(n) = T(n,n-1), array T as in A050143. Also T(2n+1,n), array T as in A055807.A050147
a(n) = T(n,n-1), array T as in A050143. Also T(2n+1,n), array T as in A055807.
- a(n) = T(n,n-2), array T as in A050143.A050148
a(n) = T(n,n-2), array T as in A050143.
- a(n) = T(n,n-3), array T as in A050143.A050149
a(n) = T(n,n-3), array T as in A050143.
- Odd numbers with prime number of divisors.A050150
Odd numbers with prime number of divisors.
- a(n) = T(n,n+2), array T as in A050143.A050151
a(n) = T(n,n+2), array T as in A050143.
- a(n) = T(n,n+3), array T as in A050143.A050152
a(n) = T(n,n+3), array T as in A050143.
- T(n,k)=M(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.A050153
T(n,k)=M(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.
- T(n,k)=M(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.A050154
T(n,k)=M(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.
- Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2).A050155
Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2).
- T(n,k)=M(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array M as in A050144.A050156
T(n,k)=M(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array M as in A050144.
- T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.A050157
T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.
- T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157.A050158
T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157.
- T(n,k) = S(2n-1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.A050159
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,n-1,k-1), 0 <= k <= n, n >= 0, array S as in A050157.A050160
T(n,k) = S(2n,n-1,k-1), 0 <= k <= n, n >= 0, array S as in A050157.