Sequences
392,541 sequences
- For n > 1: if n is present, 2n is not.A053661
For n > 1: if n is present, 2n is not.
- Numbers k such that 2k+1 divides k!+1.A053662
Numbers k such that 2k+1 divides k!+1.
- Numbers k such that 2*k+1 does not divide k!+1.A053663
Numbers k such that 2*k+1 does not divide k!+1.
- Smallest number m such that m == i (mod prime(i)) for all 1<=i<=n.A053664
Smallest number m such that m == i (mod prime(i)) for all 1<=i<=n.
- Smallest number m such that m = j^2 (mod prime(j)) for 1 <= j <= n.A053665
Smallest number m such that m = j^2 (mod prime(j)) for 1 <= j <= n.
- Product of digits of n-th prime.A053666
Product of digits of n-th prime.
- Product of digits of n^2.A053667
Product of digits of n^2.
- Product of digits of n^3.A053668
Product of digits of n^3.
- Smallest prime not dividing n.A053669
Smallest prime not dividing n.
- Least number coprime to n and n+1.A053670
Least number coprime to n and n+1.
- Least number coprime to n, n+1 and n+2.A053671
Least number coprime to n, n+1 and n+2.
- Least number coprime to n, n+1, n+2 and n+3.A053672
Least number coprime to n, n+1, n+2 and n+3.
- Least number > 1 coprime to n, n+1, n+2, n+3 and n+4.A053673
Least number > 1 coprime to n, n+1, n+2, n+3 and n+4.
- Least number coprime to n, n+1, n+2, n+3, n+4 and n+5.A053674
Least number coprime to n, n+1, n+2, n+3, n+4 and n+5.
- Positions where 5 occurs in decimal expansion of e (starting count at decimal point).A053675
Positions where 5 occurs in decimal expansion of e (starting count at decimal point).
- Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives i values.A053676
Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives i values.
- Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives j values.A053677
Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives j values.
- Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives k values.A053678
Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives k values.
- Positions where 6 occurs in the decimal expansion of e (starting count at decimal point).A053679
Positions where 6 occurs in the decimal expansion of e (starting count at decimal point).
- Positions where 7 occurs in decimal expansion of e (starting count at decimal point).A053680
Positions where 7 occurs in decimal expansion of e (starting count at decimal point).
- Positions where 8 occurs in decimal expansion of e (starting count at decimal point).A053681
Positions where 8 occurs in decimal expansion of e (starting count at decimal point).
- Positions where 9 occurs in decimal expansion of e (starting count at decimal point).A053682
Positions where 9 occurs in decimal expansion of e (starting count at decimal point).
- Number of nonprimes <= prime(n)^2.A053683
Number of nonprimes <= prime(n)^2.
- Positions where there is a repeated digit in decimal expansion of e (starting count at decimal point).A053684
Positions where there is a repeated digit in decimal expansion of e (starting count at decimal point).
- Primes p > 7 which are congruent to 2 or 4 (mod 5) for which 2p-1 is also prime.A053685
Primes p > 7 which are congruent to 2 or 4 (mod 5) for which 2p-1 is also prime.
- Record gaps between consecutive primes that repeat at least once before a new record occurs.A053686
Record gaps between consecutive primes that repeat at least once before a new record occurs.
- Positions where 1 occurs in decimal expansion of e (starting count at decimal point).A053687
Positions where 1 occurs in decimal expansion of e (starting count at decimal point).
- Positions where 2 occurs in decimal expansion of e (starting count at decimal point).A053688
Positions where 2 occurs in decimal expansion of e (starting count at decimal point).
- Positions where 3 occurs in decimal expansion of e (starting count at decimal point).A053689
Positions where 3 occurs in decimal expansion of e (starting count at decimal point).
- Positions where 4 occurs in decimal expansion of e (starting count at decimal point).A053690
Positions where 4 occurs in decimal expansion of e (starting count at decimal point).
- Number of 11-core partitions of n.A053691
Number of 11-core partitions of n.
- Number of self-conjugate 4-core partitions of n.A053692
Number of self-conjugate 4-core partitions of n.
- Number of self-conjugate 8-core partitions of n.A053693
Number of self-conjugate 8-core partitions of n.
- Number of self-conjugate 5-core partitions of n.A053694
Number of self-conjugate 5-core partitions of n.
- Differences between record prime gaps.A053695
Differences between record prime gaps.
- Numbers that can be represented as a string of three or more 1's in a base >= 2.A053696
Numbers that can be represented as a string of three or more 1's in a base >= 2.
- a(n+1)=a(n)+a^(n), where the addition is in base 11 and where a^(n) is obtained from a(n) by replacing each digit with its multiplicative inverse modulo 11. Zero digits, if any, are deleted.A053697
a(n+1)=a(n)+a^(n), where the addition is in base 11 and where a^(n) is obtained from a(n) by replacing each digit with its multiplicative inverse modulo 11. Zero digits, if any, are deleted.
- a(n) = n^3 + n^2 + n + 1.A053698
a(n) = n^3 + n^2 + n + 1.
- a(n) = n^4 + n^3 + n^2 + n + 1.A053699
a(n) = n^4 + n^3 + n^2 + n + 1.
- a(n) = 111111 in base n.A053700
a(n) = 111111 in base n.
- Vertically symmetric numbers.A053701
Vertically symmetric numbers.
- Odd prime powers p^w (w>1) such that p^w+2 is prime.A053702
Odd prime powers p^w (w>1) such that p^w+2 is prime.
- Primes q of form q=p^w+2 where p is odd prime, w>=2.A053703
Primes q of form q=p^w+2 where p is odd prime, w>=2.
- Prime powers p^w (w >= 2) such that p^w-2 is prime.A053704
Prime powers p^w (w >= 2) such that p^w-2 is prime.
- Primes p of form q^k-2 where q is also a prime and k > 1.A053705
Primes p of form q^k-2 where q is also a prime and k > 1.
- Primes p such that between p and the next prime, 2 prime powers (A025475) occur.A053706
Primes p such that between p and the next prime, 2 prime powers (A025475) occur.
- First differences of A025475, powers of a prime but not prime.A053707
First differences of A025475, powers of a prime but not prime.
- Nearest prime to n! (but not equal to n!).A053708
Nearest prime to n! (but not equal to n!).
- Prime balanced factorials: numbers k such that k! is the mean of its 2 closest primes.A053709
Prime balanced factorials: numbers k such that k! is the mean of its 2 closest primes.
- Prime-balanced factorials: factorials k! that are the mean of their 2 closest neighboring primes.A053710
Prime-balanced factorials: factorials k! that are the mean of their 2 closest neighboring primes.