Sequences
392,541 sequences
- Floor[ concatenation of numbers from n to 1 divided by concatenation of numbers from 1 to n].A075011
Floor[ concatenation of numbers from n to 1 divided by concatenation of numbers from 1 to n].
- Duplicate of A067090.A075012
Duplicate of A067090.
- Smallest k such that the decimal concatenation of k and k+1 is divisible by n.A075013
Smallest k such that the decimal concatenation of k and k+1 is divisible by n.
- Smallest k such that the concatenation k, k-1 is divisible by n; or 0 if no such number exists.A075014
Smallest k such that the concatenation k, k-1 is divisible by n; or 0 if no such number exists.
- Smallest k such that the concatenation k, k+1, k+2 is divisible by n; or 0 if no such number exists.A075015
Smallest k such that the concatenation k, k+1, k+2 is divisible by n; or 0 if no such number exists.
- Smallest k such that the concatenation k, k-1,k-2 is divisible by n; or 0 if no such number exists.A075016
Smallest k such that the concatenation k, k-1,k-2 is divisible by n; or 0 if no such number exists.
- Smallest k such that the concatenation k, k+1,k+2,k+3 is divisible by n; or 0 if no such number exists.A075017
Smallest k such that the concatenation k, k+1,k+2,k+3 is divisible by n; or 0 if no such number exists.
- Smallest k such that the concatenation k, k-1,k-2,k-3 is divisible by n; or 0 if no such number exists.A075018
Smallest k such that the concatenation k, k-1,k-2,k-3 is divisible by n; or 0 if no such number exists.
- a(1) = 1; for n > 1, a(n) = the smallest prime divisor of the number C(n) formed from the concatenation of 1,2,3,... up to n.A075019
a(1) = 1; for n > 1, a(n) = the smallest prime divisor of the number C(n) formed from the concatenation of 1,2,3,... up to n.
- a(1) = 1; for n>1, a(n) = the smallest prime divisor of the number C(n) formed from the reverse concatenation of 1,2,3,... up to n.A075020
a(1) = 1; for n>1, a(n) = the smallest prime divisor of the number C(n) formed from the reverse concatenation of 1,2,3,... up to n.
- a(1) = 1; for n>1, a(n) = the largest prime divisor of the number C(n) formed from the concatenation of n, n-1, n-2, n-3, ... down to 1.A075021
a(1) = 1; for n>1, a(n) = the largest prime divisor of the number C(n) formed from the concatenation of n, n-1, n-2, n-3, ... down to 1.
- a(1) = 1; for n>1, a(n) = the largest prime divisor of the number C(n) formed from the concatenation of 1,2,3,... up to n.A075022
a(1) = 1; for n>1, a(n) = the largest prime divisor of the number C(n) formed from the concatenation of 1,2,3,... up to n.
- a(n) = the smallest prime divisor of A173426(n) = concatenation of (1, 2, 3,..., n, n-1, ..., 1) for n > 1; a(1) = 1.A075023
a(n) = the smallest prime divisor of A173426(n) = concatenation of (1, 2, 3,..., n, n-1, ..., 1) for n > 1; a(1) = 1.
- a(n) is the largest prime divisor of the number A173426(n) = concatenate(1,2,...,n-1,n,n-1,...,2,1); a(1) = 1.A075024
a(n) is the largest prime divisor of the number A173426(n) = concatenate(1,2,...,n-1,n,n-1,...,2,1); a(1) = 1.
- Numbers k such that d(k) < d(k-1) and d(k) < d(k+1), where d(k) is the number of divisors of k.A075025
Numbers k such that d(k) < d(k-1) and d(k) < d(k+1), where d(k) is the number of divisors of k.
- Define a number k to occupy a divisor cavity if d(k-1) > d(k) < d(k+1) where d(k) is the number of divisors of k. Sequence gives composite numbers occupying a divisor cavity.A075026
Define a number k to occupy a divisor cavity if d(k-1) > d(k) < d(k+1) where d(k) is the number of divisors of k. Sequence gives composite numbers occupying a divisor cavity.
- Numbers k such that d(k-1) < d(k) > d(k+1), d = A000005.A075027
Numbers k such that d(k-1) < d(k) > d(k+1), d = A000005.
- a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.A075028
a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.
- a(n) is the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are decreasing.A075029
a(n) is the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are decreasing.
- Primes for which the four closest primes are smaller.A075030
Primes for which the four closest primes are smaller.
- a(n) is the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are nonincreasing.A075031
a(n) is the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are nonincreasing.
- Numbers k such that tau(k) <= tau(k+1) <= tau(k+2) where tau(k) = number of divisors of k.A075032
Numbers k such that tau(k) <= tau(k+1) <= tau(k+2) where tau(k) = number of divisors of k.
- Numbers k such that tau(k) <= tau(k+1) <= tau(k+2) <= tau(k+3) where tau(k) = number of divisors of k.A075033
Numbers k such that tau(k) <= tau(k+1) <= tau(k+2) <= tau(k+3) where tau(k) = number of divisors of k.
- Numbers k such that tau(k) >= tau(k+1) >= tau(k+2) where tau(k) = number of divisors of k.A075034
Numbers k such that tau(k) >= tau(k+1) >= tau(k+2) where tau(k) = number of divisors of k.
- Numbers k such that tau(k) >= tau(k+1) >= tau(k+2) >= tau(k+3) where tau(k) = number of divisors of k.A075035
Numbers k such that tau(k) >= tau(k+1) >= tau(k+2) >= tau(k+3) where tau(k) = number of divisors of k.
- Smaller of two smallest consecutive numbers with 2n divisors.A075036
Smaller of two smallest consecutive numbers with 2n divisors.
- Primes for which the five closest primes are smaller.A075037
Primes for which the five closest primes are smaller.
- Primes for which the six closest primes are smaller.A075038
Primes for which the six closest primes are smaller.
- Smallest of three consecutive squarefree numbers having equal numbers of prime factors.A075039
Smallest of three consecutive squarefree numbers having equal numbers of prime factors.
- a(1) = 0; a(n) = smallest of three consecutive numbers all with 2n divisors.A075040
a(1) = 0; a(n) = smallest of three consecutive numbers all with 2n divisors.
- Erroneous version of A006049.A075041
Erroneous version of A006049.
- Duplicate of A045983.A075042
Duplicate of A045983.
- Primes for which the seven closest primes are smaller.A075043
Primes for which the seven closest primes are smaller.
- a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n-1 have n distinct prime divisors, or 0 if no such number exists.A075044
a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n-1 have n distinct prime divisors, or 0 if no such number exists.
- Coefficients A_n for the s=3 tennis ball problem.A075045
Coefficients A_n for the s=3 tennis ball problem.
- a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in nondescending order.A075046
a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in nondescending order.
- Numbers k whose prime factorization contains the same digits as k.A075047
Numbers k whose prime factorization contains the same digits as k.
- 10-smooth numbers that show their prime factors.A075048
10-smooth numbers that show their prime factors.
- Numbers k such that every digit of k is a divisor of k and every divisor of k in the range [2,9] occurs at least once as a digit of k.A075049
Numbers k such that every digit of k is a divisor of k and every divisor of k in the range [2,9] occurs at least once as a digit of k.
- Primes for which the eight closest primes are smaller.A075050
Primes for which the eight closest primes are smaller.
- Smallest prime for which the n closest primes are smaller.A075051
Smallest prime for which the n closest primes are smaller.
- Write down squares and cubes in order, as in A002760. The sequence gives the first differences between terms.A075052
Write down squares and cubes in order, as in A002760. The sequence gives the first differences between terms.
- Number of primes (counted with repetition) that can be formed by rearranging some or all of the digits of n.A075053
Number of primes (counted with repetition) that can be formed by rearranging some or all of the digits of n.
- Smallest k such that (n+1)(n+2)...(n+k) is divisible by n!.A075054
Smallest k such that (n+1)(n+2)...(n+k) is divisible by n!.
- Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.A075055
Smallest integer of the form product (n+1)(n+2)...(n+k)/n!.
- a(1) = 0, then smallest square such that a(n+1) - a(n) is a palindrome.A075056
a(1) = 0, then smallest square such that a(n+1) - a(n) is a palindrome.
- a(1) = 0, then smallest triangular number such that a(n+1)- a(n) is a palindrome.A075057
a(1) = 0, then smallest triangular number such that a(n+1)- a(n) is a palindrome.
- Lexicographically earliest infinite sequence of distinct positive numbers with the property that every positive integer is a sum of distinct terms (see algorithm below).A075058
Lexicographically earliest infinite sequence of distinct positive numbers with the property that every positive integer is a sum of distinct terms (see algorithm below).
- a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).A075059
a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).
- a(n) = solution to the postage stamp problem with n denominations and 10 stamps.A075060
a(n) = solution to the postage stamp problem with n denominations and 10 stamps.