Sequences
392,541 sequences
- n occurs n times, with distinct successive terms.A095161
n occurs n times, with distinct successive terms.
- Index of first occurrence of n in A095161.A095162
Index of first occurrence of n in A095161.
- a(n) = smallest divisor d of n that occurs earlier in the sequence fewer than d times.A095163
a(n) = smallest divisor d of n that occurs earlier in the sequence fewer than d times.
- Index of the first occurrence of n in A095163.A095164
Index of the first occurrence of n in A095163.
- n divided by A095163(n).A095165
n divided by A095163(n).
- Group the natural numbers >= 1 so that the n-th group contains n(n+1)/2 numbers and obtain the group sum.A095166
Group the natural numbers >= 1 so that the n-th group contains n(n+1)/2 numbers and obtain the group sum.
- Triangle read by rows in which the n-th row contains n numbers noncoprime to n and not occurring in earlier rows.A095167
Triangle read by rows in which the n-th row contains n numbers noncoprime to n and not occurring in earlier rows.
- Leading diagonal of A095169.A095168
Leading diagonal of A095169.
- Leading diagonal of the triangle A095167.A095169
Leading diagonal of the triangle A095167.
- Row sums of A095167.A095170
Row sums of A095167.
- Number of multiples of n in the n-th row of the triangle A095167.A095171
Number of multiples of n in the n-th row of the triangle A095167.
- Image of 1,1,1,... under the map Q.A095172
Image of 1,1,1,... under the map Q.
- Image of 1,2,3,4,... under the map Q defined in A095172.A095173
Image of 1,2,3,4,... under the map Q defined in A095172.
- Inverse image of primes 2,3,5,7,... under the map Q defined in A095172.A095174
Inverse image of primes 2,3,5,7,... under the map Q defined in A095172.
- Denominator of b(n) given by b(1) = 1, b(2) = 2; for n >= 3, b(n) = (-1)^n (2n-1) ((n-2)!!)^2/((n-1)!!)^2, where n!! is the double factorial A006882.A095175
Denominator of b(n) given by b(1) = 1, b(2) = 2; for n >= 3, b(n) = (-1)^n (2n-1) ((n-2)!!)^2/((n-1)!!)^2, where n!! is the double factorial A006882.
- E.g.f.: exp(9x)/(1-9x)^(1/9).A095176
E.g.f.: exp(9x)/(1-9x)^(1/9).
- E.g.f.: exp(x)/(1-x)^5.A095177
E.g.f.: exp(x)/(1-x)^5.
- Final digit of the (10^n)-th prime.A095178
Final digit of the (10^n)-th prime.
- Numbers whose reversed digit representation is prime.A095179
Numbers whose reversed digit representation is prime.
- Reverse digits of primes, append to sequence if result is a prime.A095180
Reverse digits of primes, append to sequence if result is a prime.
- Triangle read by rows in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j).A095181
Triangle read by rows in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j).
- Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.A095182
Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.
- a(n) = least prime of the form prime(n+1) + k*prime(n).A095183
a(n) = least prime of the form prime(n+1) + k*prime(n).
- a(1) = 3; for n > 1 a(n) is the least prime of form a(n-1) + k*prime(n-1) with k > 0.A095184
a(1) = 3; for n > 1 a(n) is the least prime of form a(n-1) + k*prime(n-1) with k > 0.
- a(n) = least k such that k*n^(1/2) differs from an integer by less than 1/n.A095185
a(n) = least k such that k*n^(1/2) differs from an integer by less than 1/n.
- a(n) = least k such that k*n^(1/n) differs from an integer by at most 1/n.A095186
a(n) = least k such that k*n^(1/n) differs from an integer by at most 1/n.
- Least significant digit of (n mod 10)^floor(n/10).A095187
Least significant digit of (n mod 10)^floor(n/10).
- Smallest prime formed by the digit string after decimal point of n^(1/2), or 0 if no such prime exists.A095188
Smallest prime formed by the digit string after decimal point of n^(1/2), or 0 if no such prime exists.
- Smallest prime formed by the digit string after decimal point of n^(1/n), or 0 if no such prime exists.A095189
Smallest prime formed by the digit string after decimal point of n^(1/n), or 0 if no such prime exists.
- Doubled Thue-Morse sequence: a(2n) = A010060(n), a(2n+1) = A010060(n).A095190
Doubled Thue-Morse sequence: a(2n) = A010060(n), a(2n+1) = A010060(n).
- Composites k such that k + A001414(k) is a semiprime.A095191
Composites k such that k + A001414(k) is a semiprime.
- Smallest semiprime with same leading digits as n!.A095192
Smallest semiprime with same leading digits as n!.
- Common differences of the arithmetic progressions corresponding to A095181.A095193
Common differences of the arithmetic progressions corresponding to A095181.
- Least number that yields a semiprime when appended to n!.A095194
Least number that yields a semiprime when appended to n!.
- T(n,0) = prime(n), T(n,k) = T(n,k-1)-T(n-1,k-1), 0<=k<n, triangle read by rows.A095195
T(n,0) = prime(n), T(n,k) = T(n,k-1)-T(n-1,k-1), 0<=k<n, triangle read by rows.
- Duplicate of A074828.A095196
Duplicate of A074828.
- a(1) = 1, a(n+1) = 2 * digit reversal of a(n).A095197
a(1) = 1, a(n+1) = 2 * digit reversal of a(n).
- a(1) = 1, a(n+1) = prime(n)*Digit reversal of a(n).A095198
a(1) = 1, a(n+1) = prime(n)*Digit reversal of a(n).
- Least integer multiple of f(1/n) where f(1/n) is the number obtained by retaining only n digits after decimal and deleting the rest.A095199
Least integer multiple of f(1/n) where f(1/n) is the number obtained by retaining only n digits after decimal and deleting the rest.
- Greatest multiple of n of the form (n-1) + (n-2) + ... + (n-k), or 0 if no such number exists.A095200
Greatest multiple of n of the form (n-1) + (n-2) + ... + (n-k), or 0 if no such number exists.
- a(n) = A095200(n)/n.A095201
a(n) = A095200(n)/n.
- Value of largest k such that (n-1) + (n-2) + (n-3) + ... + (n-k) is a multiple of n, or 0 if no such k exists.A095202
Value of largest k such that (n-1) + (n-2) + (n-3) + ... + (n-k) is a multiple of n, or 0 if no such k exists.
- Numbers n such that (Pi/sqrt(2))^n is closer to its nearest integer than any value of (Pi/sqrt(2))^k for 1 <= k < n.A095203
Numbers n such that (Pi/sqrt(2))^n is closer to its nearest integer than any value of (Pi/sqrt(2))^k for 1 <= k < n.
- a(n) is the smallest number greater than a(n-1) such that in a(0) through a(n) no digit occurs more than once more than any other digit.A095204
a(n) is the smallest number greater than a(n-1) such that in a(0) through a(n) no digit occurs more than once more than any other digit.
- Least nonnegative integer not already in the sequence such that the frequency of digits in the entire sequence is as close to a uniform distribution as possible. A difference in frequency of at most 1 across all digits is allowed, and that difference must always be in favor of digits closer to 0.A095205
Least nonnegative integer not already in the sequence such that the frequency of digits in the entire sequence is as close to a uniform distribution as possible. A difference in frequency of at most 1 across all digits is allowed, and that difference must always be in favor of digits closer to 0.
- Let n = abcd...; a,b,c,d,... are digits of n. Define f(a) = bcd..., f(b) = acd..., f(c) = abd... and f(d) = abc..., i.e., f(i) = number obtained by deleting the digit i from n. Then a(n) = Sum f(i) mod i, where i ranges over all the nonzero digits of n.A095206
Let n = abcd...; a,b,c,d,... are digits of n. Define f(a) = bcd..., f(b) = acd..., f(c) = abd... and f(d) = abc..., i.e., f(i) = number obtained by deleting the digit i from n. Then a(n) = Sum f(i) mod i, where i ranges over all the nonzero digits of n.
- Lexicographically first sequence in which every positive integer k appears tau(k)=A000005(k) times and no two consecutive terms are equal.A095207
Lexicographically first sequence in which every positive integer k appears tau(k)=A000005(k) times and no two consecutive terms are equal.
- n if n is composite else 10*n.A095208
n if n is composite else 10*n.
- a(0) = 1, and for n > 0, a(n) = the least multiple of prime(n) such that the geometric mean of a(0) to a(n) is an integer.A095209
a(0) = 1, and for n > 0, a(n) = the least multiple of prime(n) such that the geometric mean of a(0) to a(n) is an integer.
- a(n) = least multiple of n such that the geometric mean of a(1), ..., a(n) is an integer.A095210
a(n) = least multiple of n such that the geometric mean of a(1), ..., a(n) is an integer.