Sequences
392,541 sequences
- Number of square divisors of central binomial coefficients.A056061
Number of square divisors of central binomial coefficients.
- Run lengths in infinite binary Champernowne string (A030190) formed by concatenation of 0, 1, 2 ... in base 2.A056062
Run lengths in infinite binary Champernowne string (A030190) formed by concatenation of 0, 1, 2 ... in base 2.
- Coefficients in power series of autocorrelation function of a spin s=1/2 particle in Heisenberg chain at infinite temperature.A056063
Coefficients in power series of autocorrelation function of a spin s=1/2 particle in Heisenberg chain at infinite temperature.
- The Kubelsky sequence: Jack Benny's reported age, sampled annually.A056064
The Kubelsky sequence: Jack Benny's reported age, sampled annually.
- Order of certain group related to alternating sign matrices.A056065
Order of certain group related to alternating sign matrices.
- Expansion of log( dC(x)/dx ), C(x) = e.g.f. for labeled connected graphs (A001187).A056066
Expansion of log( dC(x)/dx ), C(x) = e.g.f. for labeled connected graphs (A001187).
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d=0 and d=1 (and possibly larger d), where f = floor(k/2).A056067
Numbers k such that k! is divisible by the square of (f+d)!^2 for d=0 and d=1 (and possibly larger d), where f = floor(k/2).
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).A056068
Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).
- Number of 4-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 4 labeled nodes and n hyperedges.A056069
Number of 4-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 4 labeled nodes and n hyperedges.
- Number of 5-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 5 labeled nodes and n hyperedges.A056070
Number of 5-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 5 labeled nodes and n hyperedges.
- Number of 6-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 6 labeled nodes and n hyperedges.A056071
Number of 6-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 6 labeled nodes and n hyperedges.
- a(n) = floor(e^e^ ... ^e), with n e's.A056072
a(n) = floor(e^e^ ... ^e), with n e's.
- Number of 7-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 7 labeled nodes and n hyperedges.A056073
Number of 7-element ordered antichains on an unlabeled n-element set; T_1-hypergraphs with 7 labeled nodes and n hyperedges.
- Number of 3-element ordered antichain covers of an unlabeled n-element set.A056074
Number of 3-element ordered antichain covers of an unlabeled n-element set.
- Numbers m such that m divides sigma(m) - d(m).A056075
Numbers m such that m divides sigma(m) - d(m).
- Numbers k that divide sigma(k) + d(k), where d(k) is the number of divisors of k and sigma(k) is their sum.A056076
Numbers k that divide sigma(k) + d(k), where d(k) is the number of divisors of k and sigma(k) is their sum.
- Indices n of terms of sequence A001142, Product_{k=0..n} binomial(n,k), that are divisible by all primes <= n.A056077
Indices n of terms of sequence A001142, Product_{k=0..n} binomial(n,k), that are divisible by all primes <= n.
- Number of proper T_1-hypergraphs with 3 labeled nodes and n hyperedges.A056078
Number of proper T_1-hypergraphs with 3 labeled nodes and n hyperedges.
- Number of 7 X 7 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.A056079
Number of 7 X 7 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.
- Number of 5 X 5 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.A056080
Number of 5 X 5 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.
- Numbers that are congruent to {1, 26} mod 27.A056081
Numbers that are congruent to {1, 26} mod 27.
- Numbers k such that k^4 == 1 (mod 5^3).A056082
Numbers k such that k^4 == 1 (mod 5^3).
- Numbers k such that k^6 == 1 (mod 7^3).A056083
Numbers k such that k^6 == 1 (mod 7^3).
- Numbers k such that k^8 == 1 (mod 9^3).A056084
Numbers k such that k^8 == 1 (mod 9^3).
- Numbers k such that k^10 == 1 (mod 11^3).A056085
Numbers k such that k^10 == 1 (mod 11^3).
- Numbers k such that k^12 == 1 (mod 13^3).A056086
Numbers k such that k^12 == 1 (mod 13^3).
- Numbers k such that k^14 == 1 (mod 15^3).A056087
Numbers k such that k^14 == 1 (mod 15^3).
- Numbers k such that k^16 == 1 (mod 17^3).A056088
Numbers k such that k^16 == 1 (mod 17^3).
- Numbers k such that k^18 == 1 (mod 19^3).A056089
Numbers k such that k^18 == 1 (mod 19^3).
- Number of 4-element ordered antichain covers of an unlabeled n-element set.A056090
Number of 4-element ordered antichain covers of an unlabeled n-element set.
- Numbers k such that k^4 == 1 (mod 5^4).A056091
Numbers k such that k^4 == 1 (mod 5^4).
- Numbers k such that k^6 == 1 (mod 7^4).A056092
Numbers k such that k^6 == 1 (mod 7^4).
- Number of 5-element ordered antichain covers of an unlabeled n-element set.A056093
Number of 5-element ordered antichain covers of an unlabeled n-element set.
- Numbers k such that k^10 == 1 (mod 11^4).A056094
Numbers k such that k^10 == 1 (mod 11^4).
- Numbers k such that k^12 == 1 (mod 13^4).A056095
Numbers k such that k^12 == 1 (mod 13^4).
- Maximum value in the distribution by first value of Prufer code of noncrossing spanning trees on a circle of n+2 points; perhaps the number whose Prufer code starts with 2.A056096
Maximum value in the distribution by first value of Prufer code of noncrossing spanning trees on a circle of n+2 points; perhaps the number whose Prufer code starts with 2.
- Numbers n such that phi(n) + 1 | sigma(n).A056097
Numbers n such that phi(n) + 1 | sigma(n).
- Minimum value in the distribution by first value of Prufer code of noncrossing spanning trees on a circle of n+2 points.A056098
Minimum value in the distribution by first value of Prufer code of noncrossing spanning trees on a circle of n+2 points.
- First differences of A025488 (binary order for least prime signatures).A056099
First differences of A025488 (binary order for least prime signatures).
- a(n) = sigma(n)*phi(n) + 1 (mod n).A056100
a(n) = sigma(n)*phi(n) + 1 (mod n).
- Number of 8-antichain covers of a labeled n-set.A056101
Number of 8-antichain covers of a labeled n-set.
- Numbers k such that k^4 == 1 (mod 5^5).A056102
Numbers k such that k^4 == 1 (mod 5^5).
- Numbers k such that k^6 == 1 (mod 7^5).A056103
Numbers k such that k^6 == 1 (mod 7^5).
- Number of 9-antichain covers of a labeled n-set.A056104
Number of 9-antichain covers of a labeled n-set.
- First spoke of a hexagonal spiral.A056105
First spoke of a hexagonal spiral.
- Second spoke of a hexagonal spiral.A056106
Second spoke of a hexagonal spiral.
- Third spoke of a hexagonal spiral.A056107
Third spoke of a hexagonal spiral.
- Fourth spoke of a hexagonal spiral.A056108
Fourth spoke of a hexagonal spiral.
- Fifth spoke of a hexagonal spiral.A056109
Fifth spoke of a hexagonal spiral.
- Highest proper factor of n!-1, or a(n)=1 if n!-1 is not composite.A056110
Highest proper factor of n!-1, or a(n)=1 if n!-1 is not composite.