Sequences
392,541 sequences
- Domination number for kings' graph K(n).A075561
Domination number for kings' graph K(n).
- Rearrangement of natural numbers such that every partial sum is a proper prime power.A075562
Rearrangement of natural numbers such that every partial sum is a proper prime power.
- Rearrangement of natural numbers such that n-th partial sum is == n (mod p(n)).A075563
Rearrangement of natural numbers such that n-th partial sum is == n (mod p(n)).
- Rearrangement of natural numbers such that n-th partial sum is == n (mod c(n)). where c(n) is the n-th composite number.A075564
Rearrangement of natural numbers such that n-th partial sum is == n (mod c(n)). where c(n) is the n-th composite number.
- Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2), where sopf(x) = sum of the distinct prime factors of x.A075565
Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2), where sopf(x) = sum of the distinct prime factors of x.
- Rearrangement of natural numbers by choosing alternately even and odd numbers such that every partial sum a(1)+...+a(n) is composite.A075566
Rearrangement of natural numbers by choosing alternately even and odd numbers such that every partial sum a(1)+...+a(n) is composite.
- Rearrangement of natural numbers by choosing alternately odd and even numbers such that every partial sum is composite.A075567
Rearrangement of natural numbers by choosing alternately odd and even numbers such that every partial sum is composite.
- Rearrangement of noncomposite numbers such that every partial sum is composite.A075568
Rearrangement of noncomposite numbers such that every partial sum is composite.
- a(1)=1, then smallest number >= the previous term such that every partial sum is a prime.A075569
a(1)=1, then smallest number >= the previous term such that every partial sum is a prime.
- Lexicographically earliest sequence of distinct composite numbers such that a(k) + a(k+1) is prime for all k.A075570
Lexicographically earliest sequence of distinct composite numbers such that a(k) + a(k+1) is prime for all k.
- Rearrangement of odd primes such that sum of three successive terms is composite.A075571
Rearrangement of odd primes such that sum of three successive terms is composite.
- Smallest prime divisor of sum of three successive terms pertaining to A075571.A075572
Smallest prime divisor of sum of three successive terms pertaining to A075571.
- a(1)=1; a(n) is the smallest positive number not occurring earlier, with different parity from a(n-1), such that sum of any subsequence of two or more consecutive terms is composite.A075573
a(1)=1; a(n) is the smallest positive number not occurring earlier, with different parity from a(n-1), such that sum of any subsequence of two or more consecutive terms is composite.
- a(1) = 1, then the smallest number (obviously even) greater than the previous term such that every partial sum is prime.A075574
a(1) = 1, then the smallest number (obviously even) greater than the previous term such that every partial sum is prime.
- Duplicate of A073655.A075575
Duplicate of A073655.
- Smaller of two consecutive squares with a prime sum.A075576
Smaller of two consecutive squares with a prime sum.
- k^2 is a term if k^2 + (k-1)^2 and k^2 + (k+1)^2 are primes.A075577
k^2 is a term if k^2 + (k-1)^2 and k^2 + (k+1)^2 are primes.
- Smaller of two successive 4th powers whose sum is a prime.A075578
Smaller of two successive 4th powers whose sum is a prime.
- Duplicate of A059788.A075579
Duplicate of A059788.
- Smallest prime p(k) such that the number of distinct prime divisors of all composite numbers between p(k) and p(k+1) is n.A075580
Smallest prime p(k) such that the number of distinct prime divisors of all composite numbers between p(k) and p(k+1) is n.
- Let P(n,X) = Product_{i=1..2n+1} (X - 1/cos(Pi*k/(2n+1))); then P(n,X) is a polynomial with integer coefficients. Sequences gives maximum values of absolute values of coefficients of P(n,X).A075581
Let P(n,X) = Product_{i=1..2n+1} (X - 1/cos(Pi*k/(2n+1))); then P(n,X) is a polynomial with integer coefficients. Sequences gives maximum values of absolute values of coefficients of P(n,X).
- Duplicate of A059960.A075582
Duplicate of A059960.
- Primes p such that the composite numbers between p and the next prime together contain exactly three distinct prime factors.A075583
Primes p such that the composite numbers between p and the next prime together contain exactly three distinct prime factors.
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 4.A075584
Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 4.
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 5.A075585
Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 5.
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 6.A075586
Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 6.
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 7.A075587
Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 7.
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 8.A075588
Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 8.
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 9.A075589
Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 9.
- Smallest number with n distinct prime divisors which is the average of a twin prime pair.A075590
Smallest number with n distinct prime divisors which is the average of a twin prime pair.
- Smallest squarefree number with n prime divisors which is the average of a twin prime pair.A075591
Smallest squarefree number with n prime divisors which is the average of a twin prime pair.
- Numbers n such that number of distinct prime divisors of n is a divisor of n.A075592
Numbers n such that number of distinct prime divisors of n is a divisor of n.
- a(1) = 1, a(2n) = prime, a(2n+1) = composite and sum of two successive terms is alternately composite or prime.A075593
a(1) = 1, a(2n) = prime, a(2n+1) = composite and sum of two successive terms is alternately composite or prime.
- a(1) = 1, a(2n) = composite, a(2n+1) = prime and sum of two successive terms is alternately prime or composite.A075594
a(1) = 1, a(2n) = composite, a(2n+1) = prime and sum of two successive terms is alternately prime or composite.
- Smallest prime that is obtained by placing digits on both sides of the n-th prime. Or smallest prime that encompasses the n-th prime.A075595
Smallest prime that is obtained by placing digits on both sides of the n-th prime. Or smallest prime that encompasses the n-th prime.
- a(1) = 2 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).A075596
a(1) = 2 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).
- a(1) = 3 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).A075597
a(1) = 3 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).
- a(1) = 5 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).A075598
a(1) = 5 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).
- a(1) = 7 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).A075599
a(1) = 7 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).
- a(1) = 11 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).A075600
a(1) = 11 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).
- a(1) = 13 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).A075601
a(1) = 13 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).
- a(1) = 17 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).A075602
a(1) = 17 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).
- Number of relatively prime numbers using all digits of n.A075603
Number of relatively prime numbers using all digits of n.
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.A075604
Smallest number k such that there are exactly n relatively prime numbers using all digits of k.
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.A075605
Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.A075606
Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.
- a(1) = 1, a(n) = smallest number not occurring earlier such that the concatenation a(n-1) and a(n) is a prime.A075607
a(1) = 1, a(n) = smallest number not occurring earlier such that the concatenation a(n-1) and a(n) is a prime.
- a(1) = 1, a(n) = smallest composite number not occurring earlier such that the concatenation a(n-1) and a(n) is a prime.A075608
a(1) = 1, a(n) = smallest composite number not occurring earlier such that the concatenation a(n-1) and a(n) is a prime.
- a(1) = 1, a(n) = smallest prime number not occurring earlier such that the concatenation a(n-1) and a(n) is a prime.A075609
a(1) = 1, a(n) = smallest prime number not occurring earlier such that the concatenation a(n-1) and a(n) is a prime.
- a(1) = 1, a(n) = smallest prime number not occurring earlier such that the concatenation a(n-1) and a(n) is a composite number.A075610
a(1) = 1, a(n) = smallest prime number not occurring earlier such that the concatenation a(n-1) and a(n) is a composite number.