Sequences
392,541 sequences
- A091242-indices of primes that are composite GF(2)[X]-polynomials.A091211
A091242-indices of primes that are composite GF(2)[X]-polynomials.
- Composite numbers whose binary representation encodes a polynomial reducible over GF(2).A091212
Composite numbers whose binary representation encodes a polynomial reducible over GF(2).
- A091242-indices of composite GF(2)[X]-polynomials that are also composite integers.A091213
A091242-indices of composite GF(2)[X]-polynomials that are also composite integers.
- Composite numbers whose binary representation encodes a polynomial irreducible over GF(2).A091214
Composite numbers whose binary representation encodes a polynomial irreducible over GF(2).
- A014580-indices of irreducible GF(2)[X]-polynomials that are composite integers.A091215
A014580-indices of irreducible GF(2)[X]-polynomials that are composite integers.
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 37, the first irregular prime.A091216
Numbers k such that numerator of Bernoulli(2*k) is divisible by 37, the first irregular prime.
- Number of permutations p of [n] such that the n-1 sums p(i)+p(i+1) (i=1,2,...n-1) are all distinct.A091217
Number of permutations p of [n] such that the n-1 sums p(i)+p(i+1) (i=1,2,...n-1) are all distinct.
- Number of nonorientable hyperbolic 3-manifolds of cusp type 1 obtained from n ideal tetrahedra.A091218
Number of nonorientable hyperbolic 3-manifolds of cusp type 1 obtained from n ideal tetrahedra.
- Moebius-analog for the domain GF(2)[X]: a(n)=0 if A091221(n)!=A091222(n) (i.e., if the polynomial is not squarefree), otherwise (-1)^A091222(n).A091219
Moebius-analog for the domain GF(2)[X]: a(n)=0 if A091221(n)!=A091222(n) (i.e., if the polynomial is not squarefree), otherwise (-1)^A091222(n).
- Number of divisors of the n-th GF(2)[X]-polynomial.A091220
Number of divisors of the n-th GF(2)[X]-polynomial.
- Number of distinct irreducible polynomials dividing n-th GF(2)[X]-polynomial.A091221
Number of distinct irreducible polynomials dividing n-th GF(2)[X]-polynomial.
- Number of irreducible polynomials dividing n-th GF(2)[X]-polynomial, counted with multiplicity.A091222
Number of irreducible polynomials dividing n-th GF(2)[X]-polynomial, counted with multiplicity.
- Differences between consecutive irreducible GF(2)[X]-polynomials.A091223
Differences between consecutive irreducible GF(2)[X]-polynomials.
- Differences between consecutive irreducible GF(2)[X]-polynomials, divided by 2.A091224
Differences between consecutive irreducible GF(2)[X]-polynomials, divided by 2.
- Characteristic function of A014580: 1 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise.A091225
Characteristic function of A014580: 1 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise.
- Number of irreducible GF(2)[X]-polynomials in range [0,n].A091226
Number of irreducible GF(2)[X]-polynomials in range [0,n].
- Inverse function of A014580: position in A014580 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise.A091227
Inverse function of A014580: position in A014580 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise.
- Smallest m >= n, such that m is irreducible when interpreted as GF(2)[X]-polynomial.A091228
Smallest m >= n, such that m is irreducible when interpreted as GF(2)[X]-polynomial.
- Smallest k such that n+k is irreducible when interpreted as GF(2)[X]-polynomial.A091229
Smallest k such that n+k is irreducible when interpreted as GF(2)[X]-polynomial.
- Iterates of A014580, starting with a(0) = 1, a(n) = A014580^(n)(1). [Here A014580^(n) means the n-th fold application of A014580].A091230
Iterates of A014580, starting with a(0) = 1, a(n) = A014580^(n)(1). [Here A014580^(n) means the n-th fold application of A014580].
- How many more primes than irreducible GF(2)[X] polynomials there are in range [0,2^n].A091231
How many more primes than irreducible GF(2)[X] polynomials there are in range [0,2^n].
- How many more primes than irreducible GF(2)[X] polynomials there are in range [2^n,2^(n+1)].A091232
How many more primes than irreducible GF(2)[X] polynomials there are in range [2^n,2^(n+1)].
- (Largest Matula-Goebel number encoding a tree with n nodes) - (smallest Matula-Goebel number encoding a tree with n nodes).A091233
(Largest Matula-Goebel number encoding a tree with n nodes) - (smallest Matula-Goebel number encoding a tree with n nodes).
- Number of ways to partition the set of divisors of n into three subsets such that their sums form an integer triangle.A091234
Number of ways to partition the set of divisors of n into three subsets such that their sums form an integer triangle.
- Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.A091235
Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.
- Nonprimes of form 4k+3.A091236
Nonprimes of form 4k+3.
- Lengths of runs in A039702.A091237
Lengths of runs in A039702.
- Number of nodes in rooted tree with GF2X-Matula number n.A091238
Number of nodes in rooted tree with GF2X-Matula number n.
- Smallest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.A091239
Smallest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.
- Largest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.A091240
Largest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.
- Size of range [Smallest GF2X-Matula number coding a tree of n nodes, Largest GF2X-Matula number coding a tree of n nodes].A091241
Size of range [Smallest GF2X-Matula number coding a tree of n nodes, Largest GF2X-Matula number coding a tree of n nodes].
- Reducible polynomials over GF(2), coded in binary.A091242
Reducible polynomials over GF(2), coded in binary.
- Differences between consecutive reducible GF(2)[X]-polynomials.A091243
Differences between consecutive reducible GF(2)[X]-polynomials.
- Number of irreducible polynomials between successive reducible GF(2)[X]-polynomials.A091244
Number of irreducible polynomials between successive reducible GF(2)[X]-polynomials.
- Number of reducible GF(2)[X]-polynomials in range [0,n].A091245
Number of reducible GF(2)[X]-polynomials in range [0,n].
- Inverse function of A091242: position in A091242 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise.A091246
Inverse function of A091242: position in A091242 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise.
- Characteristic function of A091242: 1 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise.A091247
Characteristic function of A091242: 1 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise.
- Number of irreducible factors in the factorization of X^n + 1 over GF(2) (counted with multiplicity).A091248
Number of irreducible factors in the factorization of X^n + 1 over GF(2) (counted with multiplicity).
- A014580-indices of primitive irreducible GF(2)[X]-polynomials.A091249
A014580-indices of primitive irreducible GF(2)[X]-polynomials.
- List of primitive irreducible polynomials over GF(2), interpreted as binary vectors, then written in base 10.A091250
List of primitive irreducible polynomials over GF(2), interpreted as binary vectors, then written in base 10.
- A014580-indices of nonprimitive irreducible GF(2)[X]-polynomials.A091251
A014580-indices of nonprimitive irreducible GF(2)[X]-polynomials.
- Nonprimitive irreducible polynomials over GF(2).A091252
Nonprimitive irreducible polynomials over GF(2).
- Nonprimitive irreducible polynomials over GF(2) in binary format.A091253
Nonprimitive irreducible polynomials over GF(2) in binary format.
- Reducible polynomials over GF(2) in binary format.A091254
Reducible polynomials over GF(2) in binary format.
- Square array computed from gcd(P(x),P(y)) where P(x) and P(y) are polynomials with coefficients in {0,1} given by the binary expansions of x and y, and the polynomial calculation is done over GF(2), with the result converted back to a binary number, and then expressed in decimal. Array is symmetric, and is read by falling antidiagonals.A091255
Square array computed from gcd(P(x),P(y)) where P(x) and P(y) are polynomials with coefficients in {0,1} given by the binary expansions of x and y, and the polynomial calculation is done over GF(2), with the result converted back to a binary number, and then expressed in decimal. Array is symmetric, and is read by falling antidiagonals.
- Table of lcm(x,y) computed for polynomials over GF(2), where (x,y) runs as (1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...A091256
Table of lcm(x,y) computed for polynomials over GF(2), where (x,y) runs as (1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...
- Multiplication table A x B computed for polynomials over GF(2), where (A,B) runs as (1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...A091257
Multiplication table A x B computed for polynomials over GF(2), where (A,B) runs as (1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...
- Denominator of sigma_3(n)/sigma(n).A091258
Denominator of sigma_3(n)/sigma(n).
- Numerator of sigma_3(n)/sigma(n).A091259
Numerator of sigma_3(n)/sigma(n).
- Denominator of sigma_3(n)/sigma_2(n).A091260
Denominator of sigma_3(n)/sigma_2(n).