Sequences
392,541 sequences
- LCM of (2^d - 1) where d runs over the degrees of irreducible factors of x^n + x + 1 over GF(2), divided by A046932(n).A055061
LCM of (2^d - 1) where d runs over the degrees of irreducible factors of x^n + x + 1 over GF(2), divided by A046932(n).
- Primes in A054636.A055062
Primes in A054636.
- Positions of primes in A054636 with offset 1.A055063
Positions of primes in A054636 with offset 1.
- a(n) = A004125(2^n) = A004125(2^n-1).A055064
a(n) = A004125(2^n) = A004125(2^n-1).
- Smallest even number that is the sum of distinct primes in exactly n ways.A055065
Smallest even number that is the sum of distinct primes in exactly n ways.
- Number of 7-covers of an unlabeled n-set.A055066
Number of 7-covers of an unlabeled n-set.
- Product of numbers < n which do not divide n (or 1 if no such numbers exist).A055067
Product of numbers < n which do not divide n (or 1 if no such numbers exist).
- Triangular array for David G. Cantor's sigma function.A055068
Triangular array for David G. Cantor's sigma function.
- Telephone country codes in use as of Jun 13 2000.A055069
Telephone country codes in use as of Jun 13 2000.
- Third column of triangle A055864.A055070
Third column of triangle A055864.
- Largest square dividing n!.A055071
Largest square dividing n!.
- Primes in A054637.A055072
Primes in A054637.
- Positions in A054635 where the partial sums (A054637) yield primes (A055072).A055073
Positions in A054635 where the partial sums (A054637) yield primes (A055072).
- Pointers to base-2 digits where primes occur in A054633.A055074
Pointers to base-2 digits where primes occur in A054633.
- Numbers expressible as the sum of no more than 5 squares of composite numbers, allowing repetitions.A055075
Numbers expressible as the sum of no more than 5 squares of composite numbers, allowing repetitions.
- Multiplicity of Max{gcd(d, n/d)} when d runs over divisors of n.A055076
Multiplicity of Max{gcd(d, n/d)} when d runs over divisors of n.
- Multiplicity of Max{gcd(d, n!/d)} when d runs over the divisors of n!.A055077
Multiplicity of Max{gcd(d, n!/d)} when d runs over the divisors of n!.
- Write n as a sum of terms of the form (p^2-1)/24 where p is a prime > 4; sequence gives those n which require at least 4 terms.A055078
Write n as a sum of terms of the form (p^2-1)/24 where p is a prime > 4; sequence gives those n which require at least 4 terms.
- Smallest number with exactly n nonprime divisors.A055079
Smallest number with exactly n nonprime divisors.
- Triangle T(n,k) read by rows, giving number of k-member minimal covers of an unlabeled n-set, k=1..n.A055080
Triangle T(n,k) read by rows, giving number of k-member minimal covers of an unlabeled n-set, k=1..n.
- Number of positive integers whose harmonic mean with n is a positive integer.A055081
Number of positive integers whose harmonic mean with n is a positive integer.
- Number of 4 X n binary matrices with no zero rows or columns, up to row and column permutation.A055082
Number of 4 X n binary matrices with no zero rows or columns, up to row and column permutation.
- Number of 5 X n binary matrices with no zero rows or columns, up to row and column permutation.A055083
Number of 5 X n binary matrices with no zero rows or columns, up to row and column permutation.
- Number of 6 X n binary matrices with no zero rows or columns, up to row and column permutation.A055084
Number of 6 X n binary matrices with no zero rows or columns, up to row and column permutation.
- Smallest integer containing all digits in all bases from 2 to n.A055085
Smallest integer containing all digits in all bases from 2 to n.
- n appears 1+[n/2] times.A055086
n appears 1+[n/2] times.
- Integers 0..n then 0..n then 0..n+1 then 0..n+1 etc.A055087
Integers 0..n then 0..n then 0..n+1 then 0..n+1 etc.
- Triangle of generalized Legendre symbols L(a/b) read by rows, with 1's for quadratic residues and 0's for quadratic non-residues.A055088
Triangle of generalized Legendre symbols L(a/b) read by rows, with 1's for quadratic residues and 0's for quadratic non-residues.
- List of all finite permutations in reversed colexicographic ordering.A055089
List of all finite permutations in reversed colexicographic ordering.
- Number of cycles (excluding fixed points) of the n-th finite permutation in reversed colexicographic ordering (A055089).A055090
Number of cycles (excluding fixed points) of the n-th finite permutation in reversed colexicographic ordering (A055089).
- Minimum number of transpositions needed to represent each permutation given in reversed colexicographic ordering A055089.A055091
Minimum number of transpositions needed to represent each permutation given in reversed colexicographic ordering A055089.
- Order of each permutation given in reversed colexicographic ordering A055089, i.e., the least common multiple of their cycle lengths.A055092
Order of each permutation given in reversed colexicographic ordering A055089, i.e., the least common multiple of their cycle lengths.
- Number of moved (non-fixed) elements in each permutation given in reversed colexicographic ordering A055089, i.e., the sum of their cycle lengths (excluding the 1-cycles, i.e., fixed elements).A055093
Number of moved (non-fixed) elements in each permutation given in reversed colexicographic ordering A055089, i.e., the sum of their cycle lengths (excluding the 1-cycles, i.e., fixed elements).
- Binary encoding of quadratic residue set of n. L(1/n) is the most significant bit, L(n-1/n) is the least significant bit, i.e., the rows of A055088 interpreted as binary numbers.A055094
Binary encoding of quadratic residue set of n. L(1/n) is the most significant bit, L(n-1/n) is the least significant bit, i.e., the rows of A055088 interpreted as binary numbers.
- a(n) = 2*A000120(A003188(A055094(n))) - (n-1) = 2*A005811(A055094(n)) - (n-1).A055095
a(n) = 2*A000120(A003188(A055094(n))) - (n-1) = 2*A005811(A055094(n)) - (n-1).
- Triangle read by rows, sums of 2 distinct nonzero squares: T(n,k) = k^2+n^2, (n>=2, 1 <= k <= n-1).A055096
Triangle read by rows, sums of 2 distinct nonzero squares: T(n,k) = k^2+n^2, (n>=2, 1 <= k <= n-1).
- Number of divisors for each term in the triangle A055096. It is 2 for primes (all of the form 4k+1).A055097
Number of divisors for each term in the triangle A055096. It is 2 for primes (all of the form 4k+1).
- Number of distinct anagrams of digits of n without leading zeros.A055098
Number of distinct anagrams of digits of n without leading zeros.
- Expansion of g.f.: (1 + x)/(1 - 3*x - 2*x^2).A055099
Expansion of g.f.: (1 + x)/(1 - 3*x - 2*x^2).
- In the game of backgammon, the number of blot hitting rolls when the blot is n points away, n=1,2,...,24.A055100
In the game of backgammon, the number of blot hitting rolls when the blot is n points away, n=1,2,...,24.
- Expansion of square of continued fraction 1/ ( 1+q/ ( 1+q^2/ ( 1+q^3/ ( 1+q^4/... )))).A055101
Expansion of square of continued fraction 1/ ( 1+q/ ( 1+q^2/ ( 1+q^3/ ( 1+q^4/... )))).
- Expansion of cube of continued fraction 1/ ( 1+q/ ( 1+q^2/ ( 1+q^3/ ( 1+q^4/... )))).A055102
Expansion of cube of continued fraction 1/ ( 1+q/ ( 1+q^2/ ( 1+q^3/ ( 1+q^4/... )))).
- Expansion of 4th power of continued fraction 1/ ( 1+q/ ( 1+q^2/ ( 1+q^3/ ( 1+q^4/... )))).A055103
Expansion of 4th power of continued fraction 1/ ( 1+q/ ( 1+q^2/ ( 1+q^3/ ( 1+q^4/... )))).
- Expansion of 1 + q/((1-q)*(1-q^2)) + q^2/((1-q)*(1-q^2)*(1-q^3)*(1-q^4)).A055104
Expansion of 1 + q/((1-q)*(1-q^2)) + q^2/((1-q)*(1-q^2)*(1-q^3)*(1-q^4)).
- Triangle read by rows: T(n,k) = number of noncommutative symmetric polynomials of degree n that have exactly k different variables appearing in each monomial and which generate the algebra of all noncommutative symmetric polynomials (n >= 1, 1 <= k <= n).A055105
Triangle read by rows: T(n,k) = number of noncommutative symmetric polynomials of degree n that have exactly k different variables appearing in each monomial and which generate the algebra of all noncommutative symmetric polynomials (n >= 1, 1 <= k <= n).
- Triangle T(n,k) giving number of symmetric polynomials of degree n in k noncommuting variables, n >=2, 2 <= k <= n.A055106
Triangle T(n,k) giving number of symmetric polynomials of degree n in k noncommuting variables, n >=2, 2 <= k <= n.
- Triangle T(k,n) giving number of symmetric polynomials of degree n in k noncommuting variables, n >=2, 2 <= k <= n.A055107
Triangle T(k,n) giving number of symmetric polynomials of degree n in k noncommuting variables, n >=2, 2 <= k <= n.
- Largest odd number that can be represented in exactly n ways as p+2*i^2 where p is 1 or a prime and i >= 0.A055108
Largest odd number that can be represented in exactly n ways as p+2*i^2 where p is 1 or a prime and i >= 0.
- Numbers k such that Q(sqrt(-k)) has class number 6.A055109
Numbers k such that Q(sqrt(-k)) has class number 6.
- Numbers k such that Q(sqrt(-k)) has class number 8.A055110
Numbers k such that Q(sqrt(-k)) has class number 8.