Sequences
392,541 sequences
- Numbers k such that sigma(x) = k has exactly 5 solutions.A060661
Numbers k such that sigma(x) = k has exactly 5 solutions.
- Numbers k such that sigma(x) = k has exactly 6 solutions.A060662
Numbers k such that sigma(x) = k has exactly 6 solutions.
- Numbers k such that sigma(x) = k has exactly 7 solutions.A060663
Numbers k such that sigma(x) = k has exactly 7 solutions.
- Numbers k such that sigma(x) = k has exactly 8 solutions.A060664
Numbers k such that sigma(x) = k has exactly 8 solutions.
- Numbers k such that sigma(x) = k has exactly 9 solutions.A060665
Numbers k such that sigma(x) = k has exactly 9 solutions.
- Numbers k such that sigma(x) = k has exactly 10 solutions.A060666
Numbers k such that sigma(x) = k has exactly 10 solutions.
- Numbers k such that phi(x) = k has exactly 4 solutions.A060667
Numbers k such that phi(x) = k has exactly 4 solutions.
- Numbers k such that phi(x) = k has exactly 5 solutions.A060668
Numbers k such that phi(x) = k has exactly 5 solutions.
- Numbers k such that phi(x) = k has exactly 6 solutions.A060669
Numbers k such that phi(x) = k has exactly 6 solutions.
- Numbers k such that phi(x) = k has exactly 7 solutions.A060670
Numbers k such that phi(x) = k has exactly 7 solutions.
- Numbers k such that phi(x) = k has exactly 8 solutions.A060671
Numbers k such that phi(x) = k has exactly 8 solutions.
- Numbers k such that phi(x) = k has exactly 9 solutions.A060672
Numbers k such that phi(x) = k has exactly 9 solutions.
- Numbers k such that phi(x) = k has exactly 10 solutions.A060673
Numbers k such that phi(x) = k has exactly 10 solutions.
- Numbers k such that phi(x) = k has exactly 11 solutions.A060674
Numbers k such that phi(x) = k has exactly 11 solutions.
- Numbers k such that phi(x) = k has exactly 12 solutions.A060675
Numbers k such that phi(x) = k has exactly 12 solutions.
- Numbers k such that sigma (x) = k has exactly 12 solutions.A060676
Numbers k such that sigma (x) = k has exactly 12 solutions.
- Number of linear n-celled polyominoes, those with the property that a line can be drawn that intersects the interior of every cell.A060677
Number of linear n-celled polyominoes, those with the property that a line can be drawn that intersects the interior of every cell.
- Numbers k such that sigma (x) = k has exactly 11 solutions.A060678
Numbers k such that sigma (x) = k has exactly 11 solutions.
- Orders of non-cyclic groups.A060679
Orders of non-cyclic groups.
- Smallest difference between consecutive divisors of n.A060680
Smallest difference between consecutive divisors of n.
- Largest difference between consecutive divisors of n (ordered by size).A060681
Largest difference between consecutive divisors of n (ordered by size).
- Number of distinct differences between consecutive divisors of n (ordered by size).A060682
Number of distinct differences between consecutive divisors of n (ordered by size).
- Numbers for which the differences between consecutive divisors (ordered by size) are distinct.A060683
Numbers for which the differences between consecutive divisors (ordered by size) are distinct.
- Smallest difference between consecutive divisors (ordered by size) of 2n+1.A060684
Smallest difference between consecutive divisors (ordered by size) of 2n+1.
- Largest difference between consecutive divisors (ordered by size) of 2n+1.A060685
Largest difference between consecutive divisors (ordered by size) of 2n+1.
- Duplicate of A004214.A060686
Duplicate of A004214.
- Numbers k such that there exist exactly 2 Abelian groups of order k, i.e., A000688(k) = 2.A060687
Numbers k such that there exist exactly 2 Abelian groups of order k, i.e., A000688(k) = 2.
- Number of dissimilar ternary squarefree words of length n+1.A060688
Number of dissimilar ternary squarefree words of length n+1.
- Number of nonabelian groups of order n.A060689
Number of nonabelian groups of order n.
- a(n) = binomial(2^n + n - 1, n).A060690
a(n) = binomial(2^n + n - 1, n).
- Expansion of AGM(1,1-8x) (where AGM denotes the arithmetic-geometric mean).A060691
Expansion of AGM(1,1-8x) (where AGM denotes the arithmetic-geometric mean).
- Number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n.A060692
Number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n.
- Triangle (0 <= k <= n) read by rows: T(n, k) is the number of Schröder paths from (0,0) to (2n,0) having k peaks.A060693
Triangle (0 <= k <= n) read by rows: T(n, k) is the number of Schröder paths from (0,0) to (2n,0) having k peaks.
- A triangle related to rooted trees.A060694
A triangle related to rooted trees.
- a(n) = gcd(2n, A060766(2n)).A060695
a(n) = gcd(2n, A060766(2n)).
- Number of permutations in S_n avoiding the strings 123, 321 and 231.A060696
Number of permutations in S_n avoiding the strings 123, 321 and 231.
- The sum of the first a(n) composite numbers plus 1 is a prime.A060697
The sum of the first a(n) composite numbers plus 1 is a prime.
- The sum of the first n composite numbers minus 1 is a prime.A060698
The sum of the first n composite numbers minus 1 is a prime.
- a(n) = floor(A^(C^n)), where A = 2.084551112207285611..., C = 1.221.A060699
a(n) = floor(A^(C^n)), where A = 2.084551112207285611..., C = 1.221.
- "Anomalous" numbers k such that for even numbers 2k, gcd(2k, lcm(dd(2k)))=2k and not k, where dd(2k) is the first difference set of divisors of 2k.A060700
"Anomalous" numbers k such that for even numbers 2k, gcd(2k, lcm(dd(2k)))=2k and not k, where dd(2k) is the first difference set of divisors of 2k.
- Table by antidiagonals of Mahonian numbers T(n,k): permutations of n letters with k inversions.A060701
Table by antidiagonals of Mahonian numbers T(n,k): permutations of n letters with k inversions.
- Orders of finite groups that have trivial center.A060702
Orders of finite groups that have trivial center.
- Negative values of 2*x*y^4 + x^2*y^3 - 2*x^3*y*2 - x^4*y - y^5 + 2*y for x,y >= 0.A060703
Negative values of 2*x*y^4 + x^2*y^3 - 2*x^3*y*2 - x^4*y - y^5 + 2*y for x,y >= 0.
- Singular n X n matrices over GF(2).A060704
Singular n X n matrices over GF(2).
- Singular n X n matrices over GF(3).A060705
Singular n X n matrices over GF(3).
- For n >= 1 a(n) is the size of the conjugacy class in the symmetric group S_(4n) consisting of permutations whose cycle decomposition is a product of n disjoint 4-cycles.A060706
For n >= 1 a(n) is the size of the conjugacy class in the symmetric group S_(4n) consisting of permutations whose cycle decomposition is a product of n disjoint 4-cycles.
- Base-60 (Babylonian or sexagesimal) expansion of Pi.A060707
Base-60 (Babylonian or sexagesimal) expansion of Pi.
- The Reuleaux Triangle constant.A060708
The Reuleaux Triangle constant.
- Continued fraction expansion of the Reuleaux Triangle constant.A060709
Continued fraction expansion of the Reuleaux Triangle constant.
- Number of subgroups of dihedral group with 2n elements, counting conjugate subgroups only once, i.e., conjugacy classes of subgroups of the dihedral group.A060710
Number of subgroups of dihedral group with 2n elements, counting conjugate subgroups only once, i.e., conjugacy classes of subgroups of the dihedral group.