Sequences
392,541 sequences
- Discriminants of imaginary quadratic fields with class number 14 (negated).A046011
Discriminants of imaginary quadratic fields with class number 14 (negated).
- Discriminants of imaginary quadratic fields with class number 15 (negated).A046012
Discriminants of imaginary quadratic fields with class number 15 (negated).
- Discriminants of imaginary quadratic fields with class number 16 (negated).A046013
Discriminants of imaginary quadratic fields with class number 16 (negated).
- Discriminants of imaginary quadratic fields with class number 17 (negated).A046014
Discriminants of imaginary quadratic fields with class number 17 (negated).
- Discriminants of imaginary quadratic fields with class number 18 (negated).A046015
Discriminants of imaginary quadratic fields with class number 18 (negated).
- Discriminants of imaginary quadratic fields with class number 19 (negated).A046016
Discriminants of imaginary quadratic fields with class number 19 (negated).
- Least k > 1 with k = sum of digits of k^n, or 0 if no such k exists.A046017
Least k > 1 with k = sum of digits of k^n, or 0 if no such k exists.
- Discriminants of imaginary quadratic fields with class number 21 (negated).A046018
Discriminants of imaginary quadratic fields with class number 21 (negated).
- a(n) gives the number of different powers m^n for which the sum of the digits is equal to m.A046019
a(n) gives the number of different powers m^n for which the sum of the digits is equal to m.
- Discriminants of imaginary quadratic fields with class number 23 (negated).A046020
Discriminants of imaginary quadratic fields with class number 23 (negated).
- Least inverse of the Kempner function A002034.A046021
Least inverse of the Kempner function A002034.
- Primes together with 1 and 4.A046022
Primes together with 1 and 4.
- Number of ways to color edges of a tetrahedron using <= n colors.A046023
Number of ways to color edges of a tetrahedron using <= n colors.
- a(n) = smallest k such that Sum_{ i = 1..k } 1/prime(i) exceeds n.A046024
a(n) = smallest k such that Sum_{ i = 1..k } 1/prime(i) exceeds n.
- Numbers k such that 6*k+1, 12*k+1 and 18*k+1 are all primes.A046025
Numbers k such that 6*k+1, 12*k+1 and 18*k+1 are all primes.
- Smallest prime p dividing n#-1, n#, or n#+1, n squarefree.A046026
Smallest prime p dividing n#-1, n#, or n#+1, n squarefree.
- Smallest multiple prime factor of the n-th nonsquarefree number (A013929).A046027
Smallest multiple prime factor of the n-th nonsquarefree number (A013929).
- Largest multiple prime factor of the n-th nonsquarefree number (A013929).A046028
Largest multiple prime factor of the n-th nonsquarefree number (A013929).
- Numbers k such that (k!)^2 + 1 is prime.A046029
Numbers k such that (k!)^2 + 1 is prime.
- Numbers whose digits are squares.A046030
Numbers whose digits are squares.
- Digits are cubes.A046031
Digits are cubes.
- a(n) = (n!)^2 - 1.A046032
a(n) = (n!)^2 - 1.
- a(n) = (n!)^3 - 1.A046033
a(n) = (n!)^3 - 1.
- Numbers whose digits are primes.A046034
Numbers whose digits are primes.
- Numbers k such that the concatenation of the first k primes (A019518) is a prime.A046035
Numbers k such that the concatenation of the first k primes (A019518) is a prime.
- Indices of the concatenation of the first k odd numbers (A019519) which are primes.A046036
Indices of the concatenation of the first k odd numbers (A019519) which are primes.
- Numbers n for which floor((3/2)^n) is composite.A046037
Numbers n for which floor((3/2)^n) is composite.
- Numbers k for which [ (4/3)^k ] is composite.A046038
Numbers k for which [ (4/3)^k ] is composite.
- Numbers which cannot be represented as a sum of distinct 4th powers.A046039
Numbers which cannot be represented as a sum of distinct 4th powers.
- Numbers that are the sum of 6 but no fewer positive cubes.A046040
Numbers that are the sum of 6 but no fewer positive cubes.
- Numbers (not of the form 9n+-4) that were conjectured not to be the sum of 3 positive or negative cubes. However, further research suggests that this sequence is in fact empty.A046041
Numbers (not of the form 9n+-4) that were conjectured not to be the sum of 3 positive or negative cubes. However, further research suggests that this sequence is in fact empty.
- Number of partitions of n into fourth powers.A046042
Number of partitions of n into fourth powers.
- Autobiographical numbers (or curious numbers): list of numbers m = x_0 x_1 x_2 ... x_{b-1} (written in base b) such that x_i is the number of "digits" in m that are equal to i, for all i=0,...,b-1.A046043
Autobiographical numbers (or curious numbers): list of numbers m = x_0 x_1 x_2 ... x_{b-1} (written in base b) such that x_i is the number of "digits" in m that are equal to i, for all i=0,...,b-1.
- Sum of 13 but no fewer nonzero fourth powers.A046044
Sum of 13 but no fewer nonzero fourth powers.
- Sum of 14 but no fewer nonzero fourth powers.A046045
Sum of 14 but no fewer nonzero fourth powers.
- Sum of 15 but no fewer nonzero fourth powers.A046046
Sum of 15 but no fewer nonzero fourth powers.
- Sum of 16 but no fewer nonzero fourth powers.A046047
Sum of 16 but no fewer nonzero fourth powers.
- Numbers that are the sum of 17 but no fewer nonzero fourth powers.A046048
Numbers that are the sum of 17 but no fewer nonzero fourth powers.
- Sum of 18 but no fewer nonzero fourth powers.A046049
Sum of 18 but no fewer nonzero fourth powers.
- Sum of 19 but no fewer nonzero fourth powers.A046050
Sum of 19 but no fewer nonzero fourth powers.
- Number of prime factors of Mersenne number M(n) = 2^n - 1 (counted with multiplicity).A046051
Number of prime factors of Mersenne number M(n) = 2^n - 1 (counted with multiplicity).
- Number of prime factors of Fermat number F(n).A046052
Number of prime factors of Fermat number F(n).
- Total number of prime factors of the repunit R(n) = (10^n-1)/9.A046053
Total number of prime factors of the repunit R(n) = (10^n-1)/9.
- Incrementally largest number of nonisomorphic finite Abelian groups as a function of order.A046054
Incrementally largest number of nonisomorphic finite Abelian groups as a function of order.
- Orders of finite Abelian groups having the incrementally largest numbers of nonisomorphic forms (A046054).A046055
Orders of finite Abelian groups having the incrementally largest numbers of nonisomorphic forms (A046054).
- Smallest order for which there are n nonisomorphic finite Abelian groups, or 0 if no such order exists.A046056
Smallest order for which there are n nonisomorphic finite Abelian groups, or 0 if no such order exists.
- Smallest order m > 0 for which there are n nonisomorphic finite groups of order m, or 0 if no such order exists.A046057
Smallest order m > 0 for which there are n nonisomorphic finite groups of order m, or 0 if no such order exists.
- Incrementally largest numbers of nonisomorphic finite groups of order n.A046058
Incrementally largest numbers of nonisomorphic finite groups of order n.
- Orders of finite groups having the incrementally largest numbers of nonisomorphic forms A046058.A046059
Orders of finite groups having the incrementally largest numbers of nonisomorphic forms A046058.
- 5-multiperfect numbers.A046060
5-multiperfect numbers.