Sequences
392,541 sequences
- a(n) = smallest k such that the base-2 Reverse and Add! trajectory of A075252(n) joins the trajectory of k.A092211
a(n) = smallest k such that the base-2 Reverse and Add! trajectory of A075252(n) joins the trajectory of k.
- a(n) = smallest non-palindromic k such that the base-2 Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A092210(n).A092212
a(n) = smallest non-palindromic k such that the base-2 Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A092210(n).
- In base 2: numbers n of the form k + reverse(k) for at least one k.A092213
In base 2: numbers n of the form k + reverse(k) for at least one k.
- In base 2: numbers n not of the form k + reverse(k) for any k.A092214
In base 2: numbers n not of the form k + reverse(k) for any k.
- Smallest number whose base-2 Reverse and Add! trajectory (presumably) contains exactly n base-2 palindromes, or -1 if there is no such number.A092215
Smallest number whose base-2 Reverse and Add! trajectory (presumably) contains exactly n base-2 palindromes, or -1 if there is no such number.
- Primes of the form p + 12 where p is a prime.A092216
Primes of the form p + 12 where p is a prime.
- Primes that do not divide any Euler number.A092217
Primes that do not divide any Euler number.
- Primes that divide some Euler number.A092218
Primes that divide some Euler number.
- Least even k such that the Euler number E(k) is divisible by prime(n), or 0 if there is no k.A092219
Least even k such that the Euler number E(k) is divisible by prime(n), or 0 if there is no k.
- Expansion of x*(1-x)/ ((1+x)*(1-x+x^2)) in powers of x.A092220
Expansion of x*(1-x)/ ((1+x)*(1-x+x^2)) in powers of x.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 59, the second irregular prime.A092221
Numbers k such that numerator of Bernoulli(2*k) is divisible by 59, the second irregular prime.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 67, the third irregular prime.A092222
Numbers k such that numerator of Bernoulli(2*k) is divisible by 67, the third irregular prime.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 101, the fourth irregular prime.A092223
Numbers k such that numerator of Bernoulli(2*k) is divisible by 101, the fourth irregular prime.
- Numbers k such that the numerator of Bernoulli(2*k) is divisible by 103, the fifth irregular prime.A092224
Numbers k such that the numerator of Bernoulli(2*k) is divisible by 103, the fifth irregular prime.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 131, the sixth irregular prime.A092225
Numbers k such that numerator of Bernoulli(2*k) is divisible by 131, the sixth irregular prime.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 149, the seventh irregular prime.A092226
Numbers k such that numerator of Bernoulli(2*k) is divisible by 149, the seventh irregular prime.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 157, the eighth irregular prime and first irregular prime of index 2.A092227
Numbers k such that numerator of Bernoulli(2*k) is divisible by 157, the eighth irregular prime and first irregular prime of index 2.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 233, the ninth irregular prime.A092228
Numbers k such that numerator of Bernoulli(2*k) is divisible by 233, the ninth irregular prime.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 257, the tenth irregular prime.A092229
Numbers k such that numerator of Bernoulli(2*k) is divisible by 257, the tenth irregular prime.
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime.A092230
Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 37 and 59, the first two irregular primes.A092231
Numbers k such that numerator of Bernoulli(2*k) is divisible by 37 and 59, the first two irregular primes.
- Values of n corresponding to the incrementally largest values of the least inverse A046021 of the Kempner function A002034, i.e., A002034(A092233(n)) = n.A092232
Values of n corresponding to the incrementally largest values of the least inverse A046021 of the Kempner function A002034, i.e., A002034(A092233(n)) = n.
- Incrementally largest values of the least inverse A046021 of the Kempner function A002034.A092233
Incrementally largest values of the least inverse A046021 of the Kempner function A002034.
- Continued fraction expansion of a constant x with the property that when x is added to each of these partial quotients, the resulting continued fraction has a value of 1.A092234
Continued fraction expansion of a constant x with the property that when x is added to each of these partial quotients, the resulting continued fraction has a value of 1.
- Decimal expansion of a constant x with the property that when x is added to each of the partial quotients of the continued fraction of x, the resulting continued fraction has a value of 1.A092235
Decimal expansion of a constant x with the property that when x is added to each of the partial quotients of the continued fraction of x, the resulting continued fraction has a value of 1.
- a(n) = (3^n + 2*3^(n/2)*cos(n*Pi/6))/3.A092236
a(n) = (3^n + 2*3^(n/2)*cos(n*Pi/6))/3.
- Maximum number of intercalates in a Latin square of order n.A092237
Maximum number of intercalates in a Latin square of order n.
- Number of ways to write the permutation n,n-1,...,1 of 1,2,...,n as a product of n(n-1)/2 transpositions, where each transposition of 1,2,...,n occurs exactly once.A092238
Number of ways to write the permutation n,n-1,...,1 of 1,2,...,n as a product of n(n-1)/2 transpositions, where each transposition of 1,2,...,n occurs exactly once.
- Number of orbits of length n under the map whose periodic points are counted by A061693.A092239
Number of orbits of length n under the map whose periodic points are counted by A061693.
- a(n) is the number of n-dimensional symmetry frieze designs (incorrect).A092240
a(n) is the number of n-dimensional symmetry frieze designs (incorrect).
- Triangle read by rows: row n gives coefficients of (1+x+x^2)^n mod n.A092241
Triangle read by rows: row n gives coefficients of (1+x+x^2)^n mod n.
- Numbers that are congruent to {5, 7} (mod 12).A092242
Numbers that are congruent to {5, 7} (mod 12).
- Score at stage n in "tug of war" between prime gap increases vs. prime gap decreases: start with score = 0 at n = 1 and at stage n = k > 1, increase (resp. decrease) the score by 1 if the k-th prime gap is greater (resp. less) than the previous prime gap.A092243
Score at stage n in "tug of war" between prime gap increases vs. prime gap decreases: start with score = 0 at n = 1 and at stage n = k > 1, increase (resp. decrease) the score by 1 if the k-th prime gap is greater (resp. less) than the previous prime gap.
- Numbers n such that 2^n-th prime + 2^(n-1)-th prime + 1 is prime.A092244
Numbers n such that 2^n-th prime + 2^(n-1)-th prime + 1 is prime.
- Lesser of the first twin prime pair with n digits.A092245
Lesser of the first twin prime pair with n digits.
- Odd "odious" numbers (A000069).A092246
Odd "odious" numbers (A000069).
- a(0)=1, a(n+1)=ceiling((1+1/n)^n*a(n)).A092247
a(0)=1, a(n+1)=ceiling((1+1/n)^n*a(n)).
- Parity of number of distinct primes dividing n (function omega(n)) parity of A001221.A092248
Parity of number of distinct primes dividing n (function omega(n)) parity of A001221.
- Positions of the integers in the standard diagonal enumeration of the rationals (with the integers in the first column and diagonals moving up to the right).A092249
Positions of the integers in the standard diagonal enumeration of the rationals (with the integers in the first column and diagonals moving up to the right).
- Lesser of the greatest twin prime pair with n digits.A092250
Lesser of the greatest twin prime pair with n digits.
- Lesser of the smallest twin prime pair on or after the 10^n-th prime.A092251
Lesser of the smallest twin prime pair on or after the 10^n-th prime.
- a(n) = prime(prime(10^n)).A092252
a(n) = prime(prime(10^n)).
- Nearest neighbor transform with respect to Cayley metric on Sym_n is one-to-one just for these values.A092253
Nearest neighbor transform with respect to Cayley metric on Sym_n is one-to-one just for these values.
- Number of permutations of 1,...,2n with alternate odd/even entries that have no adjacent members.A092254
Number of permutations of 1,...,2n with alternate odd/even entries that have no adjacent members.
- a(0) = 1; for n > 0, a(n) = b(n) - n*b(n-1), b() = A076177().A092255
a(0) = 1; for n > 0, a(n) = b(n) - n*b(n-1), b() = A076177().
- Nonprimes of form 6k+5.A092256
Nonprimes of form 6k+5.
- Sum_i [i*(i-th digit)] for n-th prime.A092257
Sum_i [i*(i-th digit)] for n-th prime.
- (2^n-1)^(2^n).A092258
(2^n-1)^(2^n).
- Numbers that are congruent to {4, 8} mod 12.A092259
Numbers that are congruent to {4, 8} mod 12.
- Permutation of natural numbers generated by 6-rowed array shown below.A092260
Permutation of natural numbers generated by 6-rowed array shown below.