Sequences
392,541 sequences
- Smallest multiple of n (>n) using all composite digits (4,6,8,9 and 0).A074161
Smallest multiple of n (>n) using all composite digits (4,6,8,9 and 0).
- a(1) = 1; a(n) = smallest multiple of n (>n) using all nonprime digits (1,4,6,8,9 and 0) if n is a prime else using all prime digits and 1 if n is composite; or 0 if no such number exists.A074162
a(1) = 1; a(n) = smallest multiple of n (>n) using all nonprime digits (1,4,6,8,9 and 0) if n is a prime else using all prime digits and 1 if n is composite; or 0 if no such number exists.
- Smallest k, not divisible by 10, such that R(k) > n*k, where R(k) is the digit reversal of k (A004086).A074163
Smallest k, not divisible by 10, such that R(k) > n*k, where R(k) is the digit reversal of k (A004086).
- Smallest k such that R(k) > n*k, where R(k) is the digit reversal of k (A004086) (the reversal of 10 is taken to be 01 = 1, etc.).A074164
Smallest k such that R(k) > n*k, where R(k) is the digit reversal of k (A004086) (the reversal of 10 is taken to be 01 = 1, etc.).
- Numbers n such that n!!! is an interprime.A074165
Numbers n such that n!!! is an interprime.
- Product of first n palindromes.A074166
Product of first n palindromes.
- Product of prime divisors of composite numbers between consecutive primes.A074167
Product of prime divisors of composite numbers between consecutive primes.
- Duplicate of A076978.A074168
Duplicate of A076978.
- Number of representations of n as a sum of two primes that are not congruent modulo 3.A074169
Number of representations of n as a sum of two primes that are not congruent modulo 3.
- Start with 1, add the next number if one gets a prime then add the next number else subtract the next...A074170
Start with 1, add the next number if one gets a prime then add the next number else subtract the next...
- a(1) = 1. For n >= 2, a(n) is either a(n-1)+n or a(n-1)-n; we use the minus sign only if a(n-1) is prime. E.g., since a(2)=3 is prime, a(3)=a(2)-3=0.A074171
a(1) = 1. For n >= 2, a(n) is either a(n-1)+n or a(n-1)-n; we use the minus sign only if a(n-1) is prime. E.g., since a(2)=3 is prime, a(3)=a(2)-3=0.
- Smaller of two consecutive numbers of the form p^2*q where p and q are distinct primes.A074172
Smaller of two consecutive numbers of the form p^2*q where p and q are distinct primes.
- Numbers n such that n and n+2 are of the form p^2*q where p and q are distinct primes.A074173
Numbers n such that n and n+2 are of the form p^2*q where p and q are distinct primes.
- Smallest number k such that k and k+n are of the form p^2*q where p and q are primes.A074174
Smallest number k such that k and k+n are of the form p^2*q where p and q are primes.
- Duplicate of A074174.A074175
Duplicate of A074174.
- Differences arising in A074165.A074176
Differences arising in A074165.
- Where records occur in A064413.A074177
Where records occur in A064413.
- Records of the coefficients of the continued fraction for the Product_{p prime} (1 - 2/p^2).A074178
Records of the coefficients of the continued fraction for the Product_{p prime} (1 - 2/p^2).
- a(1) = 1, a(n) = smallest multiple of n divisible by the sum of all previous terms.A074179
a(1) = 1, a(n) = smallest multiple of n divisible by the sum of all previous terms.
- a(1) = 1, a(n) = smallest multiple of n divisible by the product of all previous terms.A074180
a(1) = 1, a(n) = smallest multiple of n divisible by the product of all previous terms.
- Smallest power of n >= n!.A074181
Smallest power of n >= n!.
- Largest power of n <= n!.A074182
Largest power of n <= n!.
- Duplicate of A039960.A074183
Duplicate of A039960.
- Index of the smallest power of n >= n!.A074184
Index of the smallest power of n >= n!.
- a(1) = 1, for n > 1 a(n) is the smallest number such that the product of all previous terms is > n^n.A074185
a(1) = 1, for n > 1 a(n) is the smallest number such that the product of all previous terms is > n^n.
- a(1) = 1; a(n) is the largest number such that the product of all previous terms is < n^n.A074186
a(1) = 1; a(n) is the largest number such that the product of all previous terms is < n^n.
- Largest power (>=2) <= n!.A074187
Largest power (>=2) <= n!.
- Smallest power (>=2) >= n!.A074188
Smallest power (>=2) >= n!.
- a(1) = 1, a(2) = 2; for n > 2, a(n) = {a(n-1) +a(n+1)}/n or a(n+1) = n*a(n)-a(n-1).A074189
a(1) = 1, a(2) = 2; for n > 2, a(n) = {a(n-1) +a(n+1)}/n or a(n+1) = n*a(n)-a(n-1).
- Let the index of the largest prime power that divides n! be k then the smallest number such that n!*a(n) is a perfect k-th power.A074190
Let the index of the largest prime power that divides n! be k then the smallest number such that n!*a(n) is a perfect k-th power.
- Duplicate of A090630.A074191
Duplicate of A090630.
- Number of numbers 0 <= m < 10^n which are not the sum of one or more consecutive primes.A074192
Number of numbers 0 <= m < 10^n which are not the sum of one or more consecutive primes.
- Sum of determinants of 2nd order principal minors of powers of the matrix ((1,1,0,0),(1,0,1,0),(1,0,0,1),(1,0,0,0)).A074193
Sum of determinants of 2nd order principal minors of powers of the matrix ((1,1,0,0),(1,0,1,0),(1,0,0,1),(1,0,0,0)).
- Trimorphic numbers: a(n)^3 == a(n) (mod 10^35).A074194
Trimorphic numbers: a(n)^3 == a(n) (mod 10^35).
- Sum of the primes from smallest prime factor of n to the largest prime factor of n = largest difference between consecutive divisors of n (ordered by size).A074195
Sum of the primes from smallest prime factor of n to the largest prime factor of n = largest difference between consecutive divisors of n (ordered by size).
- Sum of palindromes from the smallest prime factor of n to the largest prime factor of n.A074196
Sum of palindromes from the smallest prime factor of n to the largest prime factor of n.
- Let b(1) = n, b(k+1) = b(k)/2 + k if b(k) is even, b(k+1) = b(k)-k otherwise; sequence gives values of b(1) = n such that b(k) = 2k-4 for k large enough.A074197
Let b(1) = n, b(k+1) = b(k)/2 + k if b(k) is even, b(k+1) = b(k)-k otherwise; sequence gives values of b(1) = n such that b(k) = 2k-4 for k large enough.
- Largest k such that 1!*2!*3!*...*k! divides n!.A074198
Largest k such that 1!*2!*3!*...*k! divides n!.
- a(n) = n!/(1!*2!*3!*...*k!) where k is the largest integer such that 1!*2!*3!*...*k! divides n!.A074199
a(n) = n!/(1!*2!*3!*...*k!) where k is the largest integer such that 1!*2!*3!*...*k! divides n!.
- a(n) = m, the smallest number such that (m+k)/k is prime for k=1, 2, ..., n.A074200
a(n) = m, the smallest number such that (m+k)/k is prime for k=1, 2, ..., n.
- Let b(1) = 1, b(2) = 2, b(n+2) = (b(n+1)+1)/(b(n)+1); then a(n) = 1 if b(n) >= 1 and a(n) = 0 otherwise (also a(n) = floor(b(n)) for n > 2).A074201
Let b(1) = 1, b(2) = 2, b(n+2) = (b(n+1)+1)/(b(n)+1); then a(n) = 1 if b(n) >= 1 and a(n) = 0 otherwise (also a(n) = floor(b(n)) for n > 2).
- Numbers k such that the number of 1's in the binary expansion of k divides 2^k-1.A074202
Numbers k such that the number of 1's in the binary expansion of k divides 2^k-1.
- Odd numbers k such that the number of 1's in the binary representation of k divides 2^k-1.A074203
Odd numbers k such that the number of 1's in the binary representation of k divides 2^k-1.
- Numbers k such that the number of 1's in the binary representation of k divides 2^k+1.A074204
Numbers k such that the number of 1's in the binary representation of k divides 2^k+1.
- Smallest positive integer whose n-th power contains an equal number of each digit (0-9) when represented in base 10.A074205
Smallest positive integer whose n-th power contains an equal number of each digit (0-9) when represented in base 10.
- Kalmár's [Kalmar's] problem: number of ordered factorizations of n.A074206
Kalmár's [Kalmar's] problem: number of ordered factorizations of n.
- Numbers n such that the sum of the first n primes divides n!.A074207
Numbers n such that the sum of the first n primes divides n!.
- Least k > 1 such that n divides sigma(k) - k.A074208
Least k > 1 such that n divides sigma(k) - k.
- a(n) = Sum_{i=n+1..2n} i^n.A074209
a(n) = Sum_{i=n+1..2n} i^n.
- Numbers k such that the number of primes <= k is equal to the sum of primes from the smallest prime factor of k to the largest prime factor of k.A074210
Numbers k such that the number of primes <= k is equal to the sum of primes from the smallest prime factor of k to the largest prime factor of k.