Sequences
392,541 sequences
- Start of a run of n consecutive positive numbers divisible respectively by first n primes.A069561
Start of a run of n consecutive positive numbers divisible respectively by first n primes.
- Numbers, m, whose odd part (largest odd divisor, A000265(m)) is a nontrivial square.A069562
Numbers, m, whose odd part (largest odd divisor, A000265(m)) is a nontrivial square.
- a(1) = 1, a(2) = 4; for n > 2, a(n) = k*a(n-1) + 1 where k is smallest number > 1 such that k*a(n-1) + 1 is a multiple of n.A069563
a(1) = 1, a(2) = 4; for n > 2, a(n) = k*a(n-1) + 1 where k is smallest number > 1 such that k*a(n-1) + 1 is a multiple of n.
- a(1) = 2; a(n) = k*a(n-1) + 1 is a multiple of n-th prime with k > 1.A069564
a(1) = 2; a(n) = k*a(n-1) + 1 is a multiple of n-th prime with k > 1.
- a(0) = 1, a(n) = k*a(n-1) + 1 is a multiple of n-th prime. If no such number exists then a(n) = 0 and a(n+1) = k*a(n-1) + 1 is a multiple of (n+1)-th prime; i.e., a(r) = smallest multiple of the r-th prime = k* a(s) + 1 where a(s) is the last nonzero term.A069565
a(0) = 1, a(n) = k*a(n-1) + 1 is a multiple of n-th prime. If no such number exists then a(n) = 0 and a(n+1) = k*a(n-1) + 1 is a multiple of (n+1)-th prime; i.e., a(r) = smallest multiple of the r-th prime = k* a(s) + 1 where a(s) is the last nonzero term.
- a(1)=0; for n >= 2, a(n) = smallest value of k such that the concatenation 1,n,n^2,..., n^(k-1), n^k,n^(k-1),...n^2,n,1 is a prime.A069566
a(1)=0; for n >= 2, a(n) = smallest value of k such that the concatenation 1,n,n^2,..., n^(k-1), n^k,n^(k-1),...n^2,n,1 is a prime.
- Smaller of two consecutive primes which are anagrams of each other.A069567
Smaller of two consecutive primes which are anagrams of each other.
- a(n) = smallest number m > 0 such that n followed by m 1's yields a prime, or -1 if no such m exists.A069568
a(n) = smallest number m > 0 such that n followed by m 1's yields a prime, or -1 if no such m exists.
- a(n) = smallest prime that can be written in base 10 using just n n's.A069569
a(n) = smallest prime that can be written in base 10 using just n n's.
- Numbers n in which the k-th digit (counted from the right) is nonzero and either a divisor or a multiple of k, for all 1 <= k <= number of digits of n.A069570
Numbers n in which the k-th digit (counted from the right) is nonzero and either a divisor or a multiple of k, for all 1 <= k <= number of digits of n.
- Numbers n in which the k-th digit (counted from the right) is nonzero and is either a divisor of k (but not 1 in case k has a single-digit prime divisor) or a multiple of k, for all 1 <= k <= number of digits of n.A069571
Numbers n in which the k-th digit (counted from the right) is nonzero and is either a divisor of k (but not 1 in case k has a single-digit prime divisor) or a multiple of k, for all 1 <= k <= number of digits of n.
- Smallest n-digit number in which the k-th digit (from the right!) is a divisor of k, greater than 1 unless k has no single-digit divisor > 1.A069572
Smallest n-digit number in which the k-th digit (from the right!) is a divisor of k, greater than 1 unless k has no single-digit divisor > 1.
- Largest n-digit number in which the k-th digit is a divisor or a multiple of k.A069573
Largest n-digit number in which the k-th digit is a divisor or a multiple of k.
- Smallest n-digit prime in which the k-th digit is a divisor or a multiple of k, or 0 if no such prime exists.A069574
Smallest n-digit prime in which the k-th digit is a divisor or a multiple of k, or 0 if no such prime exists.
- Numbers k >= 4 such that k contains the digit 0 in no base b with 2 < b < k.A069575
Numbers k >= 4 such that k contains the digit 0 in no base b with 2 < b < k.
- Smallest prime p such that A000120(nextprime(p)) - A000120(p) = n.A069576
Smallest prime p such that A000120(nextprime(p)) - A000120(p) = n.
- Smallest prime p such that pi(n) <= pi(p)*2, where pi(n) is the number of primes <= n, A000720.A069577
Smallest prime p such that pi(n) <= pi(p)*2, where pi(n) is the number of primes <= n, A000720.
- Numbers n such that n - A001414(n) = reversal of n + A001414(n).A069578
Numbers n such that n - A001414(n) = reversal of n + A001414(n).
- Numbers k such that phi(core(k)) = core(phi(k)) where core(k) is the squarefree part of k (the smallest integer such that k*core(k) is a square).A069579
Numbers k such that phi(core(k)) = core(phi(k)) where core(k) is the squarefree part of k (the smallest integer such that k*core(k) is a square).
- Number of noninvertible n X n matrices mod 4 (i.e., over the ring Z_4).A069580
Number of noninvertible n X n matrices mod 4 (i.e., over the ring Z_4).
- Triangle T(m,n) giving number of unit fractions (with odd denominators) needed to represent m/n, rational (n odd), using the greedy algorithm.A069581
Triangle T(m,n) giving number of unit fractions (with odd denominators) needed to represent m/n, rational (n odd), using the greedy algorithm.
- Primes arising in A089374.A069582
Primes arising in A089374.
- Smallest prime of the form 1,n,2n,...(k-1)n,kn,(k-1)n,...2n,n,1 for some k.A069583
Smallest prime of the form 1,n,2n,...(k-1)n,kn,(k-1)n,...2n,n,1 for some k.
- a(n) = n - largest perfect power <= n.A069584
a(n) = n - largest perfect power <= n.
- a(n) = n - largest prime power <= n.A069585
a(n) = n - largest prime power <= n.
- Smallest prime power p^k (k >= 2) such that there is a difference of exactly n between p^k and some other prime power q^m (m >= 2); or 0 if no such q^m exists.A069586
Smallest prime power p^k (k >= 2) such that there is a difference of exactly n between p^k and some other prime power q^m (m >= 2); or 0 if no such q^m exists.
- Duplicate of A059843.A069587
Duplicate of A059843.
- Smallest prime in which the n-th significant digit is a 1.A069588
Smallest prime in which the n-th significant digit is a 1.
- Smallest prime in which the n-th significant digit is a 3.A069589
Smallest prime in which the n-th significant digit is a 3.
- Smallest n-digit prime starting with a 2.A069590
Smallest n-digit prime starting with a 2.
- Smallest prime in which the n-th significant digit is a 7.A069591
Smallest prime in which the n-th significant digit is a 7.
- Smallest prime in which the n-th significant digit is a 5.A069592
Smallest prime in which the n-th significant digit is a 5.
- Smallest prime in which the n-th significant digit is a 9.A069593
Smallest prime in which the n-th significant digit is a 9.
- Smallest prime in which the n-th significant digit is a 4.A069594
Smallest prime in which the n-th significant digit is a 4.
- Smallest prime in which the n-th significant digit is a 6.A069595
Smallest prime in which the n-th significant digit is a 6.
- Smallest prime in which the n-th significant digit is an 8.A069596
Smallest prime in which the n-th significant digit is an 8.
- Smallest prime in which the n-th significant digit is a 0.A069597
Smallest prime in which the n-th significant digit is a 0.
- Primes using only one nonzero digit (with zero digits allowed).A069598
Primes using only one nonzero digit (with zero digits allowed).
- Duplicate of A088628.A069599
Duplicate of A088628.
- Smallest square containing all the digits of numbers from 1 to n. For a(10) and higher, all duplicated digits must be in the term (for example a(10) has two 1's).A069600
Smallest square containing all the digits of numbers from 1 to n. For a(10) and higher, all duplicated digits must be in the term (for example a(10) has two 1's).
- Smallest triangular number containing all the digits of numbers from 1 to n.A069601
Smallest triangular number containing all the digits of numbers from 1 to n.
- a(1) = 1; a(n) = smallest composite number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069602
a(1) = 1; a(n) = smallest composite number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 2; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069603
a(1) = 2; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 1; for n>1, a(n) = smallest number with all odd digits giving a prime in concatenation with the previous terms.A069604
a(1) = 1; for n>1, a(n) = smallest number with all odd digits giving a prime in concatenation with the previous terms.
- a(1) = 3; a(n) = smallest number such that the concatenation a(1)a(2)...a(n) is a prime.A069605
a(1) = 3; a(n) = smallest number such that the concatenation a(1)a(2)...a(n) is a prime.
- a(1) = 4; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069606
a(1) = 4; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 5; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069607
a(1) = 5; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 6; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069608
a(1) = 6; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 7; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069609
a(1) = 7; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 8; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069610
a(1) = 8; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.