Sequences
392,541 sequences
- Least k for which the integers Floor(k/(m*(m+1))) for m=1,2,...,n are distinct.A054061
Least k for which the integers Floor(k/(m*(m+1))) for m=1,2,...,n are distinct.
- Least k for which the integers Floor(k/m^2) for m=1,2,...,n are distinct.A054062
Least k for which the integers Floor(k/m^2) for m=1,2,...,n are distinct.
- Least k for which the integers Floor(k/(log(m+1))) for m=1,2,...,n are distinct.A054063
Least k for which the integers Floor(k/(log(m+1))) for m=1,2,...,n are distinct.
- Least k for which the integers floor(2k/(m*(m+1))) for m=1,2,...,n are distinct.A054064
Least k for which the integers floor(2k/(m*(m+1))) for m=1,2,...,n are distinct.
- Fractal sequence induced by tau: for k >= 1, let p(k) be the permutation of 1,2,...,k obtained by ordering the fractional parts {h*tau} for h=1,2,...,k; then juxtapose p(1),p(2),p(3),...A054065
Fractal sequence induced by tau: for k >= 1, let p(k) be the permutation of 1,2,...,k obtained by ordering the fractional parts {h*tau} for h=1,2,...,k; then juxtapose p(1),p(2),p(3),...
- Position of n-th 1 in A054065.A054066
Position of n-th 1 in A054065.
- Position of first appearance of n in A054065.A054067
Position of first appearance of n in A054065.
- Permutation of N = set of natural numbers: a(n)+C(k,2), where a=A054065 and k=Floor((1+sqrt(8n-3))/2).A054068
Permutation of N = set of natural numbers: a(n)+C(k,2), where a=A054065 and k=Floor((1+sqrt(8n-3))/2).
- Inverse of the permutation A054068 of natural numbers.A054069
Inverse of the permutation A054068 of natural numbers.
- Number of k<=n such that a(k)>n, where a is the permutation A054068 of N.A054070
Number of k<=n such that a(k)>n, where a is the permutation A054068 of N.
- Position of 1 in the permutation of 1,2,...,n obtained by ordering the fractional parts {h*sqrt(2)} for h=1,2,...,n.A054071
Position of 1 in the permutation of 1,2,...,n obtained by ordering the fractional parts {h*sqrt(2)} for h=1,2,...,n.
- Position of n in the permutation of 1,2,...,n obtained by ordering the fractional parts {h*sqrt(2)} for h=1,2,...,n.A054072
Position of n in the permutation of 1,2,...,n obtained by ordering the fractional parts {h*sqrt(2)} for h=1,2,...,n.
- Fractal sequence induced by sqrt(2): for k >= 1 let p(k) be the permutation of 1,2,...,k obtained by ordering the fractional parts {h*sqrt(2)} for h=1,2,...,k; then juxtapose p(1),p(2),p(3),...A054073
Fractal sequence induced by sqrt(2): for k >= 1 let p(k) be the permutation of 1,2,...,k obtained by ordering the fractional parts {h*sqrt(2)} for h=1,2,...,k; then juxtapose p(1),p(2),p(3),...
- Position of n-th 1 in A054073.A054074
Position of n-th 1 in A054073.
- Position of first appearance of n in A054073.A054075
Position of first appearance of n in A054073.
- Permutation of N: a(n)+C(k,2), where a=A054073 and k=Floor((1+sqrt(8n-3))/2).A054076
Permutation of N: a(n)+C(k,2), where a=A054073 and k=Floor((1+sqrt(8n-3))/2).
- Inverse of the permutation A054073 of N.A054077
Inverse of the permutation A054073 of N.
- Number of k<=n such that a(k)>n, where a is the permutation A054076 of N.A054078
Number of k<=n such that a(k)>n, where a is the permutation A054076 of N.
- Moebius transform of A000031 (starting at term 0).A054079
Moebius transform of A000031 (starting at term 0).
- Inverse Moebius transform of A001037 (starting at term 0).A054080
Inverse Moebius transform of A001037 (starting at term 0).
- Array T by antidiagonals: for n >= 0 and k >= 1, let p(k)=least positive integer not already in a(i), q(k)=p(k)+k+n-1, a(p(k))=q(k), a(q(k))=p(k); then for h>=1, T(n,h)=a(h).A054081
Array T by antidiagonals: for n >= 0 and k >= 1, let p(k)=least positive integer not already in a(i), q(k)=p(k)+k+n-1, a(p(k))=q(k), a(q(k))=p(k); then for h>=1, T(n,h)=a(h).
- Permutation of N: a(1)=2, a(2)=1 and for each k >= 2, let p(k)=least natural number not already an a(i), q(k)=p(k)+k-1, a(2k-1)=q(k), a(2k)=p(k).A054082
Permutation of N: a(1)=2, a(2)=1 and for each k >= 2, let p(k)=least natural number not already an a(i), q(k)=p(k)+k-1, a(2k-1)=q(k), a(2k)=p(k).
- a(n) = order of n in the permutation A054082 of the natural numbers if this order exists; a(n) = -1 otherwise.A054083
a(n) = order of n in the permutation A054082 of the natural numbers if this order exists; a(n) = -1 otherwise.
- Permutation of N: for each k >= 1, let p(k)=least natural number not already an a(i), q(k)=p(k)+k, a(2k-1)=q(k), a(2k)=p(k).A054084
Permutation of N: for each k >= 1, let p(k)=least natural number not already an a(i), q(k)=p(k)+k, a(2k-1)=q(k), a(2k)=p(k).
- a(n) = order of n in the permutation A054084 of the natural numbers if this order exists; a(n) = -1 otherwise.A054085
a(n) = order of n in the permutation A054084 of the natural numbers if this order exists; a(n) = -1 otherwise.
- For k >= 1, let p(k)=least h in N not already an a(i), q(k)=p(k)+k, a(3k-1)=q(k), a(3k)=p(k), a(3k+1)=least h in N not already an a(i).A054086
For k >= 1, let p(k)=least h in N not already an a(i), q(k)=p(k)+k, a(3k-1)=q(k), a(3k)=p(k), a(3k+1)=least h in N not already an a(i).
- s(3n-2), s=A054086; also a bisection of A003511.A054087
s(3n-2), s=A054086; also a bisection of A003511.
- a(n) = A054086(3n); also a bisection of A003511.A054088
a(n) = A054086(3n); also a bisection of A003511.
- For k >= 1, let p(k) = least h in N not already an a(i), q(k) = p(k)+k, a(2k) = q(k), a(2k+1) = p(k).A054089
For k >= 1, let p(k) = least h in N not already an a(i), q(k) = p(k)+k, a(2k) = q(k), a(2k+1) = p(k).
- Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T.A054090
Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T.
- Row sums of A054090.A054091
Row sums of A054090.
- T(n,n), array T as in A054090.A054092
T(n,n), array T as in A054090.
- T(n,n-1), array T as in A054090.A054093
T(n,n-1), array T as in A054090.
- T(n,n-2), array T as in A054090.A054094
T(n,n-2), array T as in A054090.
- T(n,n-3), array T as in A054090.A054095
T(n,n-3), array T as in A054090.
- T(n,2), array T as in A054090.A054096
T(n,2), array T as in A054090.
- T(n,3), array T as in A054090.A054097
T(n,3), array T as in A054090.
- Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d*r(n-k) for k=2,3,...,n, d=(-1)^(k+1), n >= 2, r(h)=sum of the numbers in row h of T.A054098
Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d*r(n-k) for k=2,3,...,n, d=(-1)^(k+1), n >= 2, r(h)=sum of the numbers in row h of T.
- Sum{T(n,k): k=0,1,...,n}, array T as in A054098.A054099
Sum{T(n,k): k=0,1,...,n}, array T as in A054098.
- T(n,n), array T as in A054098.A054100
T(n,n), array T as in A054098.
- T(n,n-1), array T as in A054098.A054101
T(n,n-1), array T as in A054098.
- T(n,n-2), array T as in A054098.A054102
T(n,n-2), array T as in A054098.
- T(n,n-3), array T as in A054098.A054103
T(n,n-3), array T as in A054098.
- T(n,2), array T as in A054098.A054104
T(n,2), array T as in A054098.
- T(n,3), array T as in A054098.A054105
T(n,3), array T as in A054098.
- Alternating sums of vertically aligned numbers in Pascal's triangle: T(n,k) = C(n,k) - C(n-2,k-1) + C(n-4,k-2) - ... +- C(n-2[n/2],m).A054106
Alternating sums of vertically aligned numbers in Pascal's triangle: T(n,k) = C(n,k) - C(n-2,k-1) + C(n-4,k-2) - ... +- C(n-2[n/2],m).
- T(n,n-3), array T as in A054106.A054107
T(n,n-3), array T as in A054106.
- a(n) = (-1)^(n+1)*Sum_{k=0..n+1}(-1)^k*binomial(2*k,k).A054108
a(n) = (-1)^(n+1)*Sum_{k=0..n+1}(-1)^k*binomial(2*k,k).
- a(n) = T(2*n+1, n), array T as in A054106.A054109
a(n) = T(2*n+1, n), array T as in A054106.
- Triangular array T(n,k): in Pascal's triangle, draw vertical lines through binomial(n-1,k-1) (if present) and binomial(n-1,k) (if present); then T(n,k) is the sum of binomial(i,j) that lie on or between the lines and not below binomial(n,k).A054110
Triangular array T(n,k): in Pascal's triangle, draw vertical lines through binomial(n-1,k-1) (if present) and binomial(n-1,k) (if present); then T(n,k) is the sum of binomial(i,j) that lie on or between the lines and not below binomial(n,k).