Sequences
392,541 sequences
- Dead-end primes in "The Prime Number Maze" reachable from 2.A065111
Dead-end primes in "The Prime Number Maze" reachable from 2.
- Smallest prime whose decimal expansion ends (nontrivially) with the n-th prime; or 0 if no such prime exists.A065112
Smallest prime whose decimal expansion ends (nontrivially) with the n-th prime; or 0 if no such prime exists.
- Sum of the squares of the a(n)-th and the (a(n)+1)st triangular numbers (A000217) is a perfect square.A065113
Sum of the squares of the a(n)-th and the (a(n)+1)st triangular numbers (A000217) is a perfect square.
- Sum of terms in the period of continued fraction for sqrt(n) (A010340) is a square.A065114
Sum of terms in the period of continued fraction for sqrt(n) (A010340) is a square.
- Least k such that the sum of terms in period of continued fraction for sqrt(k) is n.A065115
Least k such that the sum of terms in period of continued fraction for sqrt(k) is n.
- Numbers k such that sigma(k) + tau(k) and sigma(k) - tau(k) are primes.A065116
Numbers k such that sigma(k) + tau(k) and sigma(k) - tau(k) are primes.
- Primes such that prime(p) +- pi(p) are simultaneously prime.A065117
Primes such that prime(p) +- pi(p) are simultaneously prime.
- Numbers which are 19 times the sum of their digits.A065118
Numbers which are 19 times the sum of their digits.
- Numbers k such that the k-th cyclotomic polynomial is a trinomial.A065119
Numbers k such that the k-th cyclotomic polynomial is a trinomial.
- Highest power of 2 dividing A057335(n).A065120
Highest power of 2 dividing A057335(n).
- Least m such that the maximal palindrome within the period of the continued fraction for sqrt(m) is the n-th row of Pascal's triangle; or 0 if no such number exists.A065121
Least m such that the maximal palindrome within the period of the continued fraction for sqrt(m) is the n-th row of Pascal's triangle; or 0 if no such number exists.
- a(1) = 2; a(n) is smallest prime > 10*a(n-1).A065122
a(1) = 2; a(n) is smallest prime > 10*a(n-1).
- Primes which, although they have correct parity, are not in the prime number maze.A065123
Primes which, although they have correct parity, are not in the prime number maze.
- a(n) = (sum of digits of a(n-2)) + a(n-1); a(0) = 0 and a(1) = 1.A065124
a(n) = (sum of digits of a(n-2)) + a(n-1); a(0) = 0 and a(1) = 1.
- Numbers k such that the sums of the odd and even aliquot parts of k both divide k.A065125
Numbers k such that the sums of the odd and even aliquot parts of k both divide k.
- Numbers n for which sigma_2(n^2) == 3 (mod 10).A065126
Numbers n for which sigma_2(n^2) == 3 (mod 10).
- Nonsquares with number of prime factors equal to twice the number of distinct prime factors.A065127
Nonsquares with number of prime factors equal to twice the number of distinct prime factors.
- Number of invertible n X n matrices mod 4 (i.e., over the ring Z_4).A065128
Number of invertible n X n matrices mod 4 (i.e., over the ring Z_4).
- a(n) is the least m such that m/A003285(m) = n, or 0 if no such m exists.A065129
a(n) is the least m such that m/A003285(m) = n, or 0 if no such m exists.
- a(n) = A005228(n) - A000217(n).A065130
a(n) = A005228(n) - A000217(n).
- Arithmetic mean of first n terms of A001414 is an integer.A065131
Arithmetic mean of first n terms of A001414 is an integer.
- Arithmetic mean of first n terms of A008472 is an integer.A065132
Arithmetic mean of first n terms of A008472 is an integer.
- Remainder when n-th prime is divided by the number of primes not exceeding n.A065133
Remainder when n-th prime is divided by the number of primes not exceeding n.
- Remainder when n is divided by the number of primes not exceeding n.A065134
Remainder when n is divided by the number of primes not exceeding n.
- Numbers m such that prime(m) = pi(m)*k + 1 for some k.A065135
Numbers m such that prime(m) = pi(m)*k + 1 for some k.
- Numbers n such that n = pi(n)*k + 1 for some k.A065136
Numbers n such that n = pi(n)*k + 1 for some k.
- Sum of digits of n plus sum of cubes of digits of n.A065137
Sum of digits of n plus sum of cubes of digits of n.
- Numbers that are equal to the sum of their digits plus the sum of cubes of their digits.A065138
Numbers that are equal to the sum of their digits plus the sum of cubes of their digits.
- Numbers n such that the sum of prime(n) and pi(n) is divisible by n.A065139
Numbers n such that the sum of prime(n) and pi(n) is divisible by n.
- a(n) = 2^n*(2*n)!.A065140
a(n) = 2^n*(2*n)!.
- a(n) = (n+1)*2^n*(2*n)!.A065141
a(n) = (n+1)*2^n*(2*n)!.
- a(n) = 2^n*(n+1)*(3*n)!.A065142
a(n) = 2^n*(n+1)*(3*n)!.
- a(n) = Sum_{k=0..n} Stirling2(n,k)*(1+(-1)^k)*2^k/2.A065143
a(n) = Sum_{k=0..n} Stirling2(n,k)*(1+(-1)^k)*2^k/2.
- Smallest prime containing the n-th square in decimal notation.A065144
Smallest prime containing the n-th square in decimal notation.
- Smallest prime that begins with the n-th square in decimal notation.A065145
Smallest prime that begins with the n-th square in decimal notation.
- Numbers n such that the arithmetic, geometric and harmonic means of phi(n) and sigma(n) are all integers.A065146
Numbers n such that the arithmetic, geometric and harmonic means of phi(n) and sigma(n) are all integers.
- 100 written in base 15-n.A065147
100 written in base 15-n.
- Nonprimes m such that phi(m)*sigma(m) is divisible by m+1.A065148
Nonprimes m such that phi(m)*sigma(m) is divisible by m+1.
- Composite numbers m such that phi(m)*sigma(m) is divisible by m-1.A065149
Composite numbers m such that phi(m)*sigma(m) is divisible by m-1.
- Numbers k such that the harmonic mean of phi(k) and sigma(k) is an integer.A065150
Numbers k such that the harmonic mean of phi(k) and sigma(k) is an integer.
- a(n) = prime(1 + A064722(n)).A065151
a(n) = prime(1 + A064722(n)).
- Cototient(totient(n)) - totient(cototient(n)).A065152
Cototient(totient(n)) - totient(cototient(n)).
- Numbers for which the cototient of the totient is equal to the totient of the cototient.A065153
Numbers for which the cototient of the totient is equal to the totient of the cototient.
- Numbers for which the cototient of the totient is strictly less than the totient of the cototient.A065154
Numbers for which the cototient of the totient is strictly less than the totient of the cototient.
- Numbers whose cototient of totient is strictly greater than totient of cototient.A065155
Numbers whose cototient of totient is strictly greater than totient of cototient.
- Numbers n such that some Lucas number (A000204) is divisible by n.A065156
Numbers n such that some Lucas number (A000204) is divisible by n.
- Table of binary string substitutions: a(i,j) is obtained by substituting i for each 1-bit in j.A065157
Table of binary string substitutions: a(i,j) is obtained by substituting i for each 1-bit in j.
- Table of reduced binary string substitutions: a(i,j) is obtained by substituting i for each 1-bit in j, then dividing by i.A065158
Table of reduced binary string substitutions: a(i,j) is obtained by substituting i for each 1-bit in j, then dividing by i.
- Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.A065159
Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.
- Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.A065160
Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.