Sequences
392,541 sequences
- Smaller of pair of successive n-digit primes with maximal difference.A073861
Smaller of pair of successive n-digit primes with maximal difference.
- Difference between the largest and the smallest n-digit prime.A073862
Difference between the largest and the smallest n-digit prime.
- a(1) = 4; a(n) = average of the largest and the smallest n-digit primes.A073863
a(1) = 4; a(n) = average of the largest and the smallest n-digit primes.
- Smallest n-digit prime with digit sum n, or 0 if no such prime exists.A073864
Smallest n-digit prime with digit sum n, or 0 if no such prime exists.
- Largest n-digit prime with digit sum n, or 0 if no such prime exists.A073865
Largest n-digit prime with digit sum n, or 0 if no such prime exists.
- a(n) is the smallest composite number with the sum of digits = the n-th composite number.A073866
a(n) is the smallest composite number with the sum of digits = the n-th composite number.
- Smallest prime whose digital sum is equal to the n-th composite number, or 0 if no such prime exists.A073867
Smallest prime whose digital sum is equal to the n-th composite number, or 0 if no such prime exists.
- a(n) is the smallest composite number with the sum of digits = the n-th prime number.A073868
a(n) is the smallest composite number with the sum of digits = the n-th prime number.
- a(n) = Sum_{i=0..n} A002251(i)/(n+1).A073869
a(n) = Sum_{i=0..n} A002251(i)/(n+1).
- Smallest composite number not included earlier that is a multiple of n.A073870
Smallest composite number not included earlier that is a multiple of n.
- A073870 divided by n.A073871
A073870 divided by n.
- Smallest positive triangular number not included earlier that is a multiple of n (a permutation of the triangular numbers).A073872
Smallest positive triangular number not included earlier that is a multiple of n (a permutation of the triangular numbers).
- Terms of A073872 that do not change their position in the rearrangement; i.e., values of A073872(n) which equal n(n+1)/2.A073873
Terms of A073872 that do not change their position in the rearrangement; i.e., values of A073872(n) which equal n(n+1)/2.
- A073872(n)/n.A073874
A073872(n)/n.
- Smallest nonzero Fibonacci number divisible by n not included earlier.A073875
Smallest nonzero Fibonacci number divisible by n not included earlier.
- A073875 divided by n.A073876
A073875 divided by n.
- Smallest Bell number divisible by n not included earlier, or 0 if no such number exists.A073877
Smallest Bell number divisible by n not included earlier, or 0 if no such number exists.
- A073877 divided by n.A073878
A073877 divided by n.
- a(1) = 1, a(n) = smallest number not included earlier such that a(1)+...+a(n) is a palindrome.A073879
a(1) = 1, a(n) = smallest number not included earlier such that a(1)+...+a(n) is a palindrome.
- a(1) = 1, a(n) = smallest palindrome not included earlier such that a(1)+...+a(n) is a palindrome.A073880
a(1) = 1, a(n) = smallest palindrome not included earlier such that a(1)+...+a(n) is a palindrome.
- a(n) = smallest number m (obviously prime) such that pi(m) = 2*pi(n).A073881
a(n) = smallest number m (obviously prime) such that pi(m) = 2*pi(n).
- Number of primes between n and n^2.A073882
Number of primes between n and n^2.
- a(1)=1. For n > 1, a(n) = the smallest positive integer not included earlier such that the n-th partial sum is n times a prime.A073883
a(1)=1. For n > 1, a(n) = the smallest positive integer not included earlier such that the n-th partial sum is n times a prime.
- a(1)=2. Let S(k) = sum of k terms. If S(n) is prime then a(n+1) is the smallest prime not included earlier else a(n+1) is the smallest composite number not included earlier.A073884
a(1)=2. Let S(k) = sum of k terms. If S(n) is prime then a(n+1) is the smallest prime not included earlier else a(n+1) is the smallest composite number not included earlier.
- a(1)=1, a(n) = smallest positive integer not included earlier such that the n-th partial sum is a prime iff n is a prime.A073885
a(1)=1, a(n) = smallest positive integer not included earlier such that the n-th partial sum is a prime iff n is a prime.
- Terms which retain their position in A073885, i.e., terms for which A073885(n) = n.A073886
Terms which retain their position in A073885, i.e., terms for which A073885(n) = n.
- Smallest prime p such that sum of p and the next n-1 primes is a perfect square, or 1 if no such prime exists.A073887
Smallest prime p such that sum of p and the next n-1 primes is a perfect square, or 1 if no such prime exists.
- a(1) = 1, a(2) = 2; a(n+1) = a(n)^n/a(n-1).A073888
a(1) = 1, a(2) = 2; a(n+1) = a(n)^n/a(n-1).
- a(1) = 1, a(2) = 3; for n>2, a(n) = {a(n-1)*a(n+1)}^(1/n) or a(n+1) = a(n)^n/a(n-1).A073889
a(1) = 1, a(2) = 3; for n>2, a(n) = {a(n-1)*a(n+1)}^(1/n) or a(n+1) = a(n)^n/a(n-1).
- Numerator of n/floor(sqrt(n)).A073890
Numerator of n/floor(sqrt(n)).
- a(1) = 1, a(2n) = a(2n-1) + c(n) and a(2n+1) = a(2n) - p(n), where c(n)=A002808(n) and p(n)=A000040(n) are the n-th composite and n-th prime numbers, respectively.A073891
a(1) = 1, a(2n) = a(2n-1) + c(n) and a(2n+1) = a(2n) - p(n), where c(n)=A002808(n) and p(n)=A000040(n) are the n-th composite and n-th prime numbers, respectively.
- a(1) = 1, a(2n) = a(2n-1) + p(n) and a(2n+1) = a(2n) - c(n), where p(n)=A000040(n) and c(n)=A002808(n) are the n-th composite and n-th prime numbers, respectively.A073892
a(1) = 1, a(2n) = a(2n-1) + p(n) and a(2n+1) = a(2n) - c(n), where p(n)=A000040(n) and c(n)=A002808(n) are the n-th composite and n-th prime numbers, respectively.
- a(10k) = 0 and if n is not a multiple of 10 then a(n) is the smallest positive integer such that the concatenation of the first n terms is a multiple of n.A073893
a(10k) = 0 and if n is not a multiple of 10 then a(n) is the smallest positive integer such that the concatenation of the first n terms is a multiple of n.
- a(0)=1; a(n) for n > 0 is the smallest number not used earlier such that the concatenation of a(0),...,a(n) is a multiple of n+1.A073894
a(0)=1; a(n) for n > 0 is the smallest number not used earlier such that the concatenation of a(0),...,a(n) is a multiple of n+1.
- a(1)=1. a(n)=a(n-1)+k(n). If a(n-1) is nonprime, k(n) is the smallest composite not in the set {k(i),i<n}. If a(n-1) is prime, k(n) is the smallest prime not in the set {k(i),i<n}.A073895
a(1)=1. a(n)=a(n-1)+k(n). If a(n-1) is nonprime, k(n) is the smallest composite not in the set {k(i),i<n}. If a(n-1) is prime, k(n) is the smallest prime not in the set {k(i),i<n}.
- a(1) = 1, a(n) = a(n-1) + k where k is smallest prime or composite number not used earlier according as a(n-1) is nonprime or prime.A073896
a(1) = 1, a(n) = a(n-1) + k where k is smallest prime or composite number not used earlier according as a(n-1) is nonprime or prime.
- a(1) = 1, a(n) = smallest odd or even number not occurring earlier according as n is prime or composite.A073897
a(1) = 1, a(n) = smallest odd or even number not occurring earlier according as n is prime or composite.
- a(1) = 1; for n>1, a(n) = smallest even or odd number not occurring earlier accordingly as n is prime or composite.A073898
a(1) = 1; for n>1, a(n) = smallest even or odd number not occurring earlier accordingly as n is prime or composite.
- a(1) = 1; then k-th prime prime(k) followed by prime(k) consecutive composite numbers not occurring earlier.A073899
a(1) = 1; then k-th prime prime(k) followed by prime(k) consecutive composite numbers not occurring earlier.
- a(1) = 1; then k-th prime prime(k) followed by Floor[e^k] consecutive composite numbers not occurring earlier.A073900
a(1) = 1; then k-th prime prime(k) followed by Floor[e^k] consecutive composite numbers not occurring earlier.
- Number of primes with nonzero digits and digit sum n.A073901
Number of primes with nonzero digits and digit sum n.
- Number of n-digit primes with digit sum n.A073902
Number of n-digit primes with digit sum n.
- Duplicate of A069710.A073903
Duplicate of A069710.
- Smallest multiple k*n of n having n divisors.A073904
Smallest multiple k*n of n having n divisors.
- Primes which can be written as a concatenation of p^q and q^p where p and q are primes.A073905
Primes which can be written as a concatenation of p^q and q^p where p and q are primes.
- Number of conjugacy classes in the symmetric group S_n with distinct cardinality.A073906
Number of conjugacy classes in the symmetric group S_n with distinct cardinality.
- Erroneous version of A085124.A073907
Erroneous version of A085124.
- Smallest number m such that m and the product of digits of m are both divisible by 7n, or 0 if no such number exists.A073908
Smallest number m such that m and the product of digits of m are both divisible by 7n, or 0 if no such number exists.
- Smallest number m such that m and the product of digits of m are both divisible by 2n, or 0 if no such number exists.A073909
Smallest number m such that m and the product of digits of m are both divisible by 2n, or 0 if no such number exists.
- Smallest number m such that m and the product of digits of m are both divisible by 3n, or 0 if no such number exists.A073910
Smallest number m such that m and the product of digits of m are both divisible by 3n, or 0 if no such number exists.