Sequences
392,541 sequences
- Numbers k divisible by exactly two nontrivial permutations (rearrangements) of the digits of k, excluding all permutations that result in digit loss.A090061
Numbers k divisible by exactly two nontrivial permutations (rearrangements) of the digits of k, excluding all permutations that result in digit loss.
- There is (presumably) one and only one palindrome in the Reverse and Add! trajectory of n.A090062
There is (presumably) one and only one palindrome in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) two palindromes in the Reverse and Add! trajectory of n.A090063
Numbers n such that there are (presumably) two palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) three palindromes in the Reverse and Add! trajectory of n.A090064
Numbers n such that there are (presumably) three palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) four palindromes in the Reverse and Add! trajectory of n.A090065
Numbers n such that there are (presumably) four palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) five palindromes in the Reverse and Add! trajectory of n.A090066
Numbers n such that there are (presumably) five palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) six palindromes in the Reverse and Add! trajectory of n.A090067
Numbers n such that there are (presumably) six palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) seven palindromes in the Reverse and Add! trajectory of n.A090068
Numbers n such that there are (presumably) seven palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) eight palindromes in the Reverse and Add! trajectory of n.A090069
Numbers n such that there are (presumably) eight palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) nine palindromes in the Reverse and Add! trajectory of n.A090070
Numbers n such that there are (presumably) nine palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) ten palindromes in the Reverse and Add! trajectory of n.A090071
Numbers n such that there are (presumably) ten palindromes in the Reverse and Add! trajectory of n.
- Numbers n such that there are (presumably) eleven palindromes in the Reverse and Add! trajectory of n.A090072
Numbers n such that there are (presumably) eleven palindromes in the Reverse and Add! trajectory of n.
- a(n) = least number m such that m-1, m+1 are twin primes, m=a*b and there are 2^n - 1 choices for (S, D) where S=a+b, D=a-b (a>b>1) and with both S and D primes.A090073
a(n) = least number m such that m-1, m+1 are twin primes, m=a*b and there are 2^n - 1 choices for (S, D) where S=a+b, D=a-b (a>b>1) and with both S and D primes.
- (Presumed) last palindrome in the Reverse and Add! trajectory of 10^n.A090074
(Presumed) last palindrome in the Reverse and Add! trajectory of 10^n.
- (Presumed) number of palindromes in the Reverse and Add! trajectory of 10^n.A090075
(Presumed) number of palindromes in the Reverse and Add! trajectory of 10^n.
- a(n) = prime(n)*prime(n+2).A090076
a(n) = prime(n)*prime(n+2).
- In binary expansion of n: reduce contiguous blocks of 1's to 1.A090077
In binary expansion of n: reduce contiguous blocks of 1's to 1.
- In binary expansion of n, reduce contiguous blocks of 0's to 0.A090078
In binary expansion of n, reduce contiguous blocks of 0's to 0.
- In binary expansion of n: reduce contiguous blocks of 0's to 0 and contiguous blocks of 1's to 1.A090079
In binary expansion of n: reduce contiguous blocks of 0's to 0 and contiguous blocks of 1's to 1.
- In binary expansion of n-th prime: reduce contiguous blocks of 0's to 0 and contiguous blocks of 1's to 1.A090080
In binary expansion of n-th prime: reduce contiguous blocks of 0's to 0 and contiguous blocks of 1's to 1.
- Cube root-smooth numbers: numbers k whose largest prime factor does not exceed the cube root of k.A090081
Cube root-smooth numbers: numbers k whose largest prime factor does not exceed the cube root of k.
- Even pseudoprimes to base 5.A090082
Even pseudoprimes to base 5.
- Even pseudoprimes to base 9.A090083
Even pseudoprimes to base 9.
- Even pseudoprimes to base 11.A090084
Even pseudoprimes to base 11.
- Smallest odd pseudoprimes to base n exceeding n (like A007535 but with smallest odd terms instead of few even ones).A090085
Smallest odd pseudoprimes to base n exceeding n (like A007535 but with smallest odd terms instead of few even ones).
- Smallest pseudoprime to base n, not necessarily exceeding n (cf. A007535).A090086
Smallest pseudoprime to base n, not necessarily exceeding n (cf. A007535).
- Smallest odd pseudoprimes to base n, not necessarily exceeding n. Compare with A007535 and A090086.A090087
Smallest odd pseudoprimes to base n, not necessarily exceeding n. Compare with A007535 and A090086.
- Smallest even pseudoprimes to odd base=2n-1, not necessarily exceeding n. See also A007535 and A090086, A090087.A090088
Smallest even pseudoprimes to odd base=2n-1, not necessarily exceeding n. See also A007535 and A090086, A090087.
- Smallest even pseudoprimes to odd base=4n-1, not necessarily exceeding n.A090089
Smallest even pseudoprimes to odd base=4n-1, not necessarily exceeding n.
- a(n) = prime(n)*prime(n+3).A090090
a(n) = prime(n)*prime(n+3).
- Number of groups of order 3^n.A090091
Number of groups of order 3^n.
- a(n) is the smallest composite number coprime to n, n+1 and n+2.A090092
a(n) is the smallest composite number coprime to n, n+1 and n+2.
- a(n) is the smallest composite number coprime to n, n+1, n+2, n+3.A090093
a(n) is the smallest composite number coprime to n, n+1, n+2, n+3.
- a(n) is the smallest composite number coprime to n, n+1, n+2, n+3 and n+4.A090094
a(n) is the smallest composite number coprime to n, n+1, n+2, n+3 and n+4.
- a(n) is the smallest composite number coprime to n, n+1, n+2, n+3, n+4 and n+5.A090095
a(n) is the smallest composite number coprime to n, n+1, n+2, n+3, n+4 and n+5.
- Least n-pseudoprime which is a power of a prime number; smallest prime-power pseudoprime to base n.A090096
Least n-pseudoprime which is a power of a prime number; smallest prime-power pseudoprime to base n.
- Bases n such that the smallest prime-power-pseudoprime to base n is 9.A090097
Bases n such that the smallest prime-power-pseudoprime to base n is 9.
- Bases such that the smallest prime-power-pseudoprime is belonging to equals 25.A090098
Bases such that the smallest prime-power-pseudoprime is belonging to equals 25.
- Smallest bases the smallest true-prime-power-pseudoprime is belonging to equals a true power of n-th prime.A090099
Smallest bases the smallest true-prime-power-pseudoprime is belonging to equals a true power of n-th prime.
- Numbers n such that n and the four successive integers produce primes if substituted for x in the polynomial 5x^2+5x+1. See A090562, A090563. Terms show that longer similar chains also exist.A090100
Numbers n such that n and the four successive integers produce primes if substituted for x in the polynomial 5x^2+5x+1. See A090562, A090563. Terms show that longer similar chains also exist.
- Numbers n such that n and the 6 successive integers yield primes if substituted for x in polynomial 5x^2+5x+1.A090101
Numbers n such that n and the 6 successive integers yield primes if substituted for x in polynomial 5x^2+5x+1.
- Leading prime in each set of 7 arising in A090101.A090102
Leading prime in each set of 7 arising in A090101.
- n written in base equal to the number of distinct prime factors of n and a(1)=0.A090103
n written in base equal to the number of distinct prime factors of n and a(1)=0.
- Decimal value of maximal digit of the n-th primorial when written in base n.A090104
Decimal value of maximal digit of the n-th primorial when written in base n.
- Decimal value of largest digit of n! when it was written in base n.A090105
Decimal value of largest digit of n! when it was written in base n.
- Values of k such that {P(k), P(k+1), ..., P(k+12)} are all prime numbers, where P(k) = k^2 + k + 41.A090106
Values of k such that {P(k), P(k+1), ..., P(k+12)} are all prime numbers, where P(k) = k^2 + k + 41.
- Values of k such that {P(k), P(k+1), ..., P(k+9)} are all prime numbers, where P(k) = k^2 - 79*k + 1601.A090107
Values of k such that {P(k), P(k+1), ..., P(k+9)} are all prime numbers, where P(k) = k^2 - 79*k + 1601.
- Values of k such that {P(k), P(k+1), ..., P(k+8)} are all prime numbers, whereP(k) = k^2 - 79*k + 1601.A090108
Values of k such that {P(k), P(k+1), ..., P(k+8)} are all prime numbers, whereP(k) = k^2 - 79*k + 1601.
- Values of k such that {P(k), P(k+1), ..., P(k+10)} are all prime numbers, where P(k) = k^2 - 79*k + 1601.A090109
Values of k such that {P(k), P(k+1), ..., P(k+10)} are all prime numbers, where P(k) = k^2 - 79*k + 1601.
- Values of k such that {P(k), P(k+1), ..., P(k+7)} are all prime numbers, where P(k) = 4*k^2 - 154*k + 1523.A090110
Values of k such that {P(k), P(k+1), ..., P(k+7)} are all prime numbers, where P(k) = 4*k^2 - 154*k + 1523.