cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A236834 Numbers that do not occur as results of "downward" remultiplication (N -> GF(2)[X]) of any number; numbers not present in A234741.

Original entry on oeis.org

25, 50, 55, 87, 91, 100, 110, 115, 117, 133, 143, 145, 159, 171, 174, 182, 185, 200, 203, 213, 220, 230, 234, 237, 247, 249, 253, 266, 267, 279, 285, 286, 290, 299, 301, 318, 319, 321, 333, 339, 342, 345, 348, 351, 355, 357, 361, 364, 369, 370, 375, 385, 391, 395, 400
Offset: 1

Views

Author

Antti Karttunen, Jan 31 2014

Keywords

Comments

Numbers that do not occur in A234741 (A236841).
This is a subsequence of A236838, thus all terms are GF(2)[X]-multiples of some of the terms of A091214. (Cf. also A236844).
a(5)=91 is the first term that does not occur in A236849. On the other hand, A236849(4)=75, is the first term in the latter which does not occur here.

Crossrefs

Complement: A236841. This sequence is a setwise difference of A236838 and A236839.
A091214 is a subsequence.
Positions of zeros in A236833, A236836, A236837 and A236861
Cf. also A236844, A234741, A236835.

A236841 Numbers that occur as results of downward remultiplication (N -> GF(2)[X]) of some number; A234741 sorted and duplicates removed.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70
Offset: 1

Views

Author

Antti Karttunen, Jan 31 2014

Keywords

Comments

The range of A234741: numbers n which encode by their binary representation a polynomial in GF(2)[X] whose multiset of irreducible polynomial factors P, Q, ..., W (where n = P x Q x ... x W, where P, Q, ..., W are irreducible polynomials encoded by A014580, and are not necessarily distinct, and x stands for carryless multiplication of such polynomials: A048720) can be grouped to at least one such multiset (P x Q, W), (P x W, Q), (P, Q x W), (P x Q x W), etc., in such a way that all its members are primes.
Above condition implies that none of the terms of A091214 occur here.

Examples

			17 is a term because it factors as 3 x 3 x 3 x 3 in GF(2)[X], and these can be grouped as (3x3x3x3), (3x3 * 3x3), (3 * 3 * 3x3) and (3 * 3 * 3 * 3) that is, as 17, (5 * 5), (3 * 3 * 5) and (3 * 3 * 3 * 3) which give the four different k, 17, 25, 45 and 81, for which A234741(k) = 17. (Note that A236833(17) = 4. In the grouping (3 * 3x3x3) = (3 * 15) 15 is not a prime, so it is discarded,)
25 is not a term because it is an irreducible in GF(2)[X], but not a prime in N.
43 = 3 x 25 is a term because 43 itself is a prime in N.
125 = 3 x 3 x 25 is a term, because both 3 and (3 x 25) = 43 are primes in N. Their product 3*43 = 129 gives one such k that A234741(k) = 125.
1951 = 25 x 87 is a member, as although both 25 and 87 are in A091214, 1951 is itself a prime in N.
		

Crossrefs

Positions of nonzero terms in A236833.
Complement of A236834.
Characteristic function: A236861.
A subsequence: A236839.

Formula

Use the characteristic function A236861(n) to determine whether n is a term of this sequence or not. Specifically, all primes occur in this sequence. A composite number n occurs only if there exists at least one such pair of k, m < n that n = A048720(k,m) and k and m both occur here. This implies that none of the terms of A091214 are present.

A236838 Numbers whose binary representation encodes a polynomial over GF(2) with the property that at least one of its irreducible factors is encoded by a composite number.

Original entry on oeis.org

25, 43, 50, 55, 79, 86, 87, 89, 91, 100, 110, 115, 117, 125, 133, 135, 143, 145, 149, 158, 159, 171, 172, 174, 178, 181, 182, 185, 200, 203, 209, 213, 220, 227, 230, 234, 235, 237, 247, 249, 250, 253, 263, 266, 267, 270, 279, 281, 285, 286, 290, 293, 298, 299
Offset: 1

Views

Author

Antti Karttunen, Feb 02 2014

Keywords

Comments

Numbers which are of the form A048720(a,A091214(b)) for some a, b.
In the range 1..10000 about half of the natural numbers seem to be in this set, and the terms are getting more frequent, although rather slowly. (Please see the graph.)

Examples

			25, in binary '11001', encodes polynomial x^4 + x^3 + 1, which is irreducible in polynomial ring GF(2)[X], but is composite in N, thus it is a term of this sequence.
43, in binary '101011', encodes polynomial x^5 + x^3 + x + 1, which factors as (x + 1)(x^4 + x^3 + 1), i.e., 43 = A048720(3,25), and the latter factor of these, encoded by 25, is a composite in N, thus 43 is a term of this sequence.
		

Crossrefs

Disjoint union of A236834 and A236839.
Complement: A236850.

Programs

  • Scheme
    (define A236838 (MATCHING-POS 1 1 (lambda (n) (any (lambda (p) (= 1 (A066247 p))) (GF2Xfactor n)))))
Showing 1-3 of 3 results.