Sequences
392,541 sequences
- Lower members of a "good pair" of the form (k, 2*k +- 1).A046861
Lower members of a "good pair" of the form (k, 2*k +- 1).
- Upper members of a "good pair" of the form (k, 2*k +- 1).A046862
Upper members of a "good pair" of the form (k, 2*k +- 1).
- Erroneous version of A000698.A046863
Erroneous version of A000698.
- Smallest number whose digits sum to n-th prime.A046864
Smallest number whose digits sum to n-th prime.
- Numbers k such that 4*5^k - 1 is prime.A046865
Numbers k such that 4*5^k - 1 is prime.
- Numbers k such that 6*7^k - 1 is prime.A046866
Numbers k such that 6*7^k - 1 is prime.
- Numbers k such that 10*11^k - 1 is prime.A046867
Numbers k such that 10*11^k - 1 is prime.
- Numbers n such that prime(n)^2 > prime(n-1)*prime(n+1).A046868
Numbers n such that prime(n)^2 > prime(n-1)*prime(n+1).
- Good primes (version 1): prime(n)^2 > prime(n-1)*prime(n+1).A046869
Good primes (version 1): prime(n)^2 > prime(n-1)*prime(n+1).
- Numbers k such that sigma_1(k) divides sigma_4(k).A046870
Numbers k such that sigma_1(k) divides sigma_4(k).
- Numbers k such that sigma_2(k) divides sigma_4(k).A046871
Numbers k such that sigma_2(k) divides sigma_4(k).
- F-primes.A046872
F-primes.
- Number of total orders extending inclusion on P({1,...,n}).A046873
Number of total orders extending inclusion on P({1,...,n}).
- Row/column pre-periods of Sprague-Grundy values of Wythoff's Game.A046874
Row/column pre-periods of Sprague-Grundy values of Wythoff's Game.
- Row/column periods of Sprague-Grundy values of Wythoff's Game.A046875
Row/column periods of Sprague-Grundy values of Wythoff's Game.
- Length of runs in the sequence of row/column periods of Sprague-Grundy values of Wythoff's Game (A046875).A046876
Length of runs in the sequence of row/column periods of Sprague-Grundy values of Wythoff's Game (A046875).
- a(n) = a(n-2) + a(n-3), with a(0) = 3, a(1) = 2, a(2) = 6.A046877
a(n) = a(n-2) + a(n-3), with a(0) = 3, a(1) = 2, a(2) = 6.
- Numerator of (1/n)*Sum_{k=0..n-1} 1/binomial(n-1,k) for n>0 else 0.A046878
Numerator of (1/n)*Sum_{k=0..n-1} 1/binomial(n-1,k) for n>0 else 0.
- Denominator of (1/n)*Sum_{k=0..n-1} 1/binomial(n-1,k) for n>0 else 1.A046879
Denominator of (1/n)*Sum_{k=0..n-1} 1/binomial(n-1,k) for n>0 else 1.
- Number of isolated-pentagon (IPR) fullerenes with 2n vertices (or carbon atoms).A046880
Number of isolated-pentagon (IPR) fullerenes with 2n vertices (or carbon atoms).
- Smallest number that is sum of 2 positive distinct n-th powers in 2 different ways.A046881
Smallest number that is sum of 2 positive distinct n-th powers in 2 different ways.
- Ultrafactorials: a(n) = n!^n!.A046882
Ultrafactorials: a(n) = n!^n!.
- Automorphic primes: primes p such that p is k-th prime and p ends in k.A046883
Automorphic primes: primes p such that p is k-th prime and p ends in k.
- Doubly automorphic primes: p is k-th prime, ends in k and k is itself prime.A046884
Doubly automorphic primes: p is k-th prime, ends in k and k is itself prime.
- Row sums of triangle A046658.A046885
Row sums of triangle A046658.
- Number of divisors d of 2n satisfying (d+1) = prime or number of prime factors of the denominator of the even Bernoulli numbers.A046886
Number of divisors d of 2n satisfying (d+1) = prime or number of prime factors of the denominator of the even Bernoulli numbers.
- Numbers n such that the cyclotomic polynomial of order n has a nonzero coefficient which does not appear in any cyclotomic polynomials of lower order.A046887
Numbers n such that the cyclotomic polynomial of order n has a nonzero coefficient which does not appear in any cyclotomic polynomials of lower order.
- Number of anagrams of a(n) that are prime increases.A046888
Number of anagrams of a(n) that are prime increases.
- Number of anagrams of A046888(n) that are primes.A046889
Number of anagrams of A046888(n) that are primes.
- a(n) is the least integer that has exactly n anagrams that are primes.A046890
a(n) is the least integer that has exactly n anagrams that are primes.
- Values of n where number of permutations of digits a(n) that are prime increases.A046891
Values of n where number of permutations of digits a(n) that are prime increases.
- Number of permutations of digits of A046891(n) that are primes.A046892
Number of permutations of digits of A046891(n) that are primes.
- a(n) is the least number with exactly n permutations of digits that are primes.A046893
a(n) is the least number with exactly n permutations of digits that are primes.
- Numbers expressible as p^3 + q^3 with p, q prime in at least two ways.A046894
Numbers expressible as p^3 + q^3 with p, q prime in at least two ways.
- Sizes of successive clusters in Z^4 lattice.A046895
Sizes of successive clusters in Z^4 lattice.
- Square elements of A046895.A046896
Square elements of A046895.
- Sum of divisors of n that are not divisible by 4.A046897
Sum of divisors of n that are not divisible by 4.
- Partial sums of A046897.A046898
Partial sums of A046897.
- Triangle in which n-th row is {binomial(n+k,k), k=0..n}, n >= 0.A046899
Triangle in which n-th row is {binomial(n+k,k), k=0..n}, n >= 0.
- Triangle inverse to that in A046899.A046900
Triangle inverse to that in A046899.
- a(n) = a(n-1) - n if a(n-1) > n, else a(n) = a(n-1) + n.A046901
a(n) = a(n-1) - n if a(n-1) > n, else a(n) = a(n-1) + n.
- Clark's triangle: left border = 0 1 1 1..., right border = multiples of 6; other entries = sum of 2 entries above.A046902
Clark's triangle: left border = 0 1 1 1..., right border = multiples of 6; other entries = sum of 2 entries above.
- Largest odd number that can be represented in no more than n ways as p + 2*i^2 where p is 1 or a prime and i >= 0.A046903
Largest odd number that can be represented in no more than n ways as p + 2*i^2 where p is 1 or a prime and i >= 0.
- Number of isomorphism classes of posets with n points with property that there is no nonsingelton proper subset T for which x not in T implies x<T or x>T or x incomparable with every element of T.A046904
Number of isomorphism classes of posets with n points with property that there is no nonsingelton proper subset T for which x not in T implies x<T or x>T or x incomparable with every element of T.
- Posets with n points with property that there is no nonsingelton proper subset T for which x not in T implies x<T or x>T or x incomparable with every element of T.A046905
Posets with n points with property that there is no nonsingelton proper subset T for which x not in T implies x<T or x>T or x incomparable with every element of T.
- Number of connected irreducible posets with n labeled points.A046906
Number of connected irreducible posets with n labeled points.
- Number of isomorphism classes of irreducible posets with n labeled points.A046907
Number of isomorphism classes of irreducible posets with n labeled points.
- Number of irreducible posets with n labeled points.A046908
Number of irreducible posets with n labeled points.
- Number of isomorphism classes of connected irreducible quasiorders with n labeled points.A046909
Number of isomorphism classes of connected irreducible quasiorders with n labeled points.
- Number of connected irreducible quasiorders with n labeled points.A046910
Number of connected irreducible quasiorders with n labeled points.