Sequences
392,541 sequences
- a(n) = prime(sigma(n)).A067161
a(n) = prime(sigma(n)).
- a(n) = A062361(n)/n.A067162
a(n) = A062361(n)/n.
- A067151(n)/n.A067163
A067151(n)/n.
- A067152(n)/n.A067164
A067152(n)/n.
- a(n) = A067153(n)/n.A067165
a(n) = A067153(n)/n.
- A067154(n)/n.A067166
A067154(n)/n.
- A067155(n)/n.A067167
A067155(n)/n.
- A067156(n)/n.A067168
A067156(n)/n.
- A067157(n)/n.A067169
A067157(n)/n.
- Numbers n such that sum of the cubes of the distinct prime factors of n equals the sum of the cubes of the digits of n.A067170
Numbers n such that sum of the cubes of the distinct prime factors of n equals the sum of the cubes of the digits of n.
- Numbers k such that sigma(k+1)+sigma(k) = sigma(2k+1).A067171
Numbers k such that sigma(k+1)+sigma(k) = sigma(2k+1).
- Numbers k such that sigma(k-2) + sigma(k+2) = sigma(2k).A067172
Numbers k such that sigma(k-2) + sigma(k+2) = sigma(2k).
- Numbers n such that the sum of the prime factors of n equals the product of the digits of n.A067173
Numbers n such that the sum of the prime factors of n equals the product of the digits of n.
- Product of the sum of all the subsets of the numbers from 1 to n.A067174
Product of the sum of all the subsets of the numbers from 1 to n.
- Number of digits in the n-th primorial (A002110).A067175
Number of digits in the n-th primorial (A002110).
- A triangle of generalized Stirling numbers: sum of consecutive terms in the harmonic sequence multiplied by the product of their denominators.A067176
A triangle of generalized Stirling numbers: sum of consecutive terms in the harmonic sequence multiplied by the product of their denominators.
- Cube root of A061096(n).A067177
Cube root of A061096(n).
- Smallest square whose sum of digits is A056991(n).A067178
Smallest square whose sum of digits is A056991(n).
- Smallest number whose square has sum of digits A056991(n).A067179
Smallest number whose square has sum of digits A056991(n).
- Smallest prime with digit sum n, or 0 if no such prime exists.A067180
Smallest prime with digit sum n, or 0 if no such prime exists.
- Duplicate of A062688.A067181
Duplicate of A062688.
- Smallest Fibonacci number with digit sum n, or -1 if no such number exists.A067182
Smallest Fibonacci number with digit sum n, or -1 if no such number exists.
- Product of the prime factors of n equals the product of the digits of n.A067183
Product of the prime factors of n equals the product of the digits of n.
- Numbers n such that sum of the squares of the prime factors of n equals the sum of the squares of the digits of n.A067184
Numbers n such that sum of the squares of the prime factors of n equals the sum of the squares of the digits of n.
- Numbers k such that prime(k+1) + prime(k) == 1 (mod k).A067185
Numbers k such that prime(k+1) + prime(k) == 1 (mod k).
- Numbers n such that C(n) = (n^2 + n + 2)/2 is prime.A067186
Numbers n such that C(n) = (n^2 + n + 2)/2 is prime.
- Numbers that can be expressed as the sum of two primes in exactly one way.A067187
Numbers that can be expressed as the sum of two primes in exactly one way.
- Numbers that can be expressed as the (unordered) sum of two primes in exactly two ways.A067188
Numbers that can be expressed as the (unordered) sum of two primes in exactly two ways.
- Numbers that can be expressed as the sum of two primes in exactly three ways.A067189
Numbers that can be expressed as the sum of two primes in exactly three ways.
- Numbers that can be expressed as the sum of two primes in exactly four ways.A067190
Numbers that can be expressed as the sum of two primes in exactly four ways.
- Numbers that can be expressed as the sum of two primes in exactly five ways.A067191
Numbers that can be expressed as the sum of two primes in exactly five ways.
- Composite c such that sigma(c)==2 (mod phi(c)).A067192
Composite c such that sigma(c)==2 (mod phi(c)).
- Numbers k such that sigma(k) == 4 (mod phi(k)).A067193
Numbers k such that sigma(k) == 4 (mod phi(k)).
- Sequence of prime numbers whose reverse is a nontrivial prime power (A025475).A067194
Sequence of prime numbers whose reverse is a nontrivial prime power (A025475).
- Numbers n such that M(n) = Sum_{i=1..n} mu(sigma(i)) where M(n) is the Mertens function A002321(n).A067195
Numbers n such that M(n) = Sum_{i=1..n} mu(sigma(i)) where M(n) is the Mertens function A002321(n).
- Numbers n such that M(n) = Sum_{i=1..n} mu(phi(i)) where M(n) is the Mertens function A002321(n).A067196
Numbers n such that M(n) = Sum_{i=1..n} mu(phi(i)) where M(n) is the Mertens function A002321(n).
- Numbers k such that k*(k+1)/2 is not squarefree.A067197
Numbers k such that k*(k+1)/2 is not squarefree.
- Numbers k such that sigma(k) = phi(k) + phi(k-1).A067198
Numbers k such that sigma(k) = phi(k) + phi(k-1).
- Integers k such that k*28*c + 1 is prime for c = 1, 2, 4, 7 and 14.A067199
Integers k such that k*28*c + 1 is prime for c = 1, 2, 4, 7 and 14.
- Numbers m such that m^3 + 2 is prime.A067200
Numbers m such that m^3 + 2 is prime.
- Numbers k such that k^2 + 2 is prime.A067201
Numbers k such that k^2 + 2 is prime.
- Numbers n such that sigma(n) = phi(n) + phi(n-1) + phi(n-2).A067202
Numbers n such that sigma(n) = phi(n) + phi(n-1) + phi(n-2).
- Numbers n such that sigma(n) = phi(n) + phi(n-1) + phi(n-2) + phi(n-3).A067203
Numbers n such that sigma(n) = phi(n) + phi(n-1) + phi(n-2) + phi(n-3).
- Numbers k such that sigma(sigma(k)) == phi(k) (mod sigma(k)).A067204
Numbers k such that sigma(sigma(k)) == phi(k) (mod sigma(k)).
- Least numbers with n = digital root = number of prime factors.A067205
Least numbers with n = digital root = number of prime factors.
- Numbers n such that the digits of n end in phi(n).A067206
Numbers n such that the digits of n end in phi(n).
- Numbers k such that the digits of sigma_2(k) end in k.A067207
Numbers k such that the digits of sigma_2(k) end in k.
- n is prime and remains prime when its leading digit is increased by one.A067208
n is prime and remains prime when its leading digit is increased by one.
- Number of n X n 0..1 matrices with all row and column sums equal.A067209
Number of n X n 0..1 matrices with all row and column sums equal.
- Number of n X n 0..2 matrices with all row and column sums equal.A067210
Number of n X n 0..2 matrices with all row and column sums equal.