Sequences
392,541 sequences
- Duplicate of A027611.A075711
Duplicate of A027611.
- Rearrangement of primes into Germain groups (or Cunningham chains).A075712
Rearrangement of primes into Germain groups (or Cunningham chains).
- 1+n+n^19 is a prime.A075713
1+n+n^19 is a prime.
- 1+n+n^s is a prime, s=18.A075714
1+n+n^s is a prime, s=18.
- Numbers n such that n^16 + n + 1 is prime.A075715
Numbers n such that n^16 + n + 1 is prime.
- 1+n+n^s is a prime, s=15.A075716
1+n+n^s is a prime, s=15.
- 1+n+n^13 is a prime.A075717
1+n+n^13 is a prime.
- 1+n+n^s is a prime, s=12.A075718
1+n+n^s is a prime, s=12.
- 1+n+n^s is a prime, s=10.A075719
1+n+n^s is a prime, s=10.
- Numbers n such that n^9 + n + 1 is a prime.A075720
Numbers n such that n^9 + n + 1 is a prime.
- a(n+1) = least k with sum of prime factors (with repetition) = a(n)+1 with a(0) = 2.A075721
a(n+1) = least k with sum of prime factors (with repetition) = a(n)+1 with a(0) = 2.
- Numbers n such that 1 + n + n^s is a prime, s = 7.A075722
Numbers n such that 1 + n + n^s is a prime, s = 7.
- Numbers n such that 1 + n + n^6 is a prime.A075723
Numbers n such that 1 + n + n^6 is a prime.
- Duplicate of A049408.A075724
Duplicate of A049408.
- Duplicate of A049407.A075725
Duplicate of A049407.
- a(n) = Pi * n^2 rounded off.A075726
a(n) = Pi * n^2 rounded off.
- a(n) = 2 Pi * n rounded off.A075727
a(n) = 2 Pi * n rounded off.
- Records in abs(sigma(n)-2*n) (absolute value of A033879).A075728
Records in abs(sigma(n)-2*n) (absolute value of A033879).
- Number of different hierarchical orderings that can be formed from n labeled elements: these are divided into groups and the elements in each group are then arranged in a "preferential arrangement" or "weak order" as in A000670.A075729
Number of different hierarchical orderings that can be formed from n labeled elements: these are divided into groups and the elements in each group are then arranged in a "preferential arrangement" or "weak order" as in A000670.
- Squares of odd semiprimes A046315, odd numbers divisible by exactly 2 primes (counted with multiplicity).A075730
Squares of odd semiprimes A046315, odd numbers divisible by exactly 2 primes (counted with multiplicity).
- Fibonacci numbers F(k) for k squarefree (A005117).A075731
Fibonacci numbers F(k) for k squarefree (A005117).
- Fibonacci numbers F(k) for k not squarefree (A013929).A075732
Fibonacci numbers F(k) for k not squarefree (A013929).
- Array of coefficients in Zagier's polynomials P_(n,0)(x).A075733
Array of coefficients in Zagier's polynomials P_(n,0)(x).
- Fibonacci numbers F(k) when k is a product of an even number of distinct primes A030229 (mu(k)=1).A075734
Fibonacci numbers F(k) when k is a product of an even number of distinct primes A030229 (mu(k)=1).
- Squarefree Fibonacci numbers with an even number of prime factors (mu(n)=1).A075735
Squarefree Fibonacci numbers with an even number of prime factors (mu(n)=1).
- Fibonacci numbers F(k) as k runs through the products of an odd number of distinct primes A030059 (mu(k)=-1).A075736
Fibonacci numbers F(k) as k runs through the products of an odd number of distinct primes A030059 (mu(k)=-1).
- Prime Fibonacci numbers with prime indices.A075737
Prime Fibonacci numbers with prime indices.
- Squarefree Fibonacci numbers whose indices are also squarefree.A075738
Squarefree Fibonacci numbers whose indices are also squarefree.
- Nonsquarefree Fibonacci numbers whose indices are also not squarefree.A075739
Nonsquarefree Fibonacci numbers whose indices are also not squarefree.
- Squarefree Fibonacci numbers which are the product of an even number of distinct primes and whose index is also squarefree and the product of an even number of distinct primes.A075740
Squarefree Fibonacci numbers which are the product of an even number of distinct primes and whose index is also squarefree and the product of an even number of distinct primes.
- Smallest a(n)>2 such that all integers strictly between a(n)-n and a(n) are composite.A075741
Smallest a(n)>2 such that all integers strictly between a(n)-n and a(n) are composite.
- Fibonacci numbers for which both the value and index are the product of an odd number of distinct primes; that is, numbers Fibonacci(k) for which mu(k) = mu(Fibonacci(k)) = -1.A075742
Fibonacci numbers for which both the value and index are the product of an odd number of distinct primes; that is, numbers Fibonacci(k) for which mu(k) = mu(Fibonacci(k)) = -1.
- For all numbers of the form 6 +- 1 starting with 5,7,11,13,..., '1' indicates prime and '0' indicates composite.A075743
For all numbers of the form 6 +- 1 starting with 5,7,11,13,..., '1' indicates prime and '0' indicates composite.
- Hierarchies of hierarchies.A075744
Hierarchies of hierarchies.
- Numbers n such that 210*n + 13 is prime.A075745
Numbers n such that 210*n + 13 is prime.
- Numbers n such that 210*n-13 is prime.A075746
Numbers n such that 210*n-13 is prime.
- Numbers n such that 210*n + 17 is prime.A075747
Numbers n such that 210*n + 17 is prime.
- Numbers k such that 210*k-17 is prime.A075748
Numbers k such that 210*k-17 is prime.
- Numbers k such that 210*k +- 1 are twin primes.A075749
Numbers k such that 210*k +- 1 are twin primes.
- 210*n -/+ 11 are primes.A075750
210*n -/+ 11 are primes.
- Numbers n such that 210*n -/+ 13 are primes.A075751
Numbers n such that 210*n -/+ 13 are primes.
- 210*n -/+ 17 ares both primes.A075752
210*n -/+ 17 ares both primes.
- Smallest prime factor of n-th odd triangular number; a(1) = 1.A075753
Smallest prime factor of n-th odd triangular number; a(1) = 1.
- Number of n X n (0,1) matrices containing exactly five 1's in each row and in each column.A075754
Number of n X n (0,1) matrices containing exactly five 1's in each row and in each column.
- Duplicate of A046638.A075755
Duplicate of A046638.
- Number of hierarchies of hierarchies of hierarchies on n points.A075756
Number of hierarchies of hierarchies of hierarchies on n points.
- Smallest positive integer k such that n!+k!+1 is prime, or 0 if no such k exists.A075757
Smallest positive integer k such that n!+k!+1 is prime, or 0 if no such k exists.
- Smallest k such that n!+k!-1 is prime, or 0 if no such k exists.A075758
Smallest k such that n!+k!-1 is prime, or 0 if no such k exists.
- Duplicate of A000993.A075759
Duplicate of A000993.
- Nontrivial binomial coefficients which are perfect powers (A001597).A075760
Nontrivial binomial coefficients which are perfect powers (A001597).