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.

A245701 Permutation of natural numbers: a(1) = 1, a(A014580(n)) = 2*a(n), a(A091242(n)) = 2*a(n)+1, where A014580(n) = binary code for n-th irreducible polynomial over GF(2), A091242(n) = binary code for n-th reducible polynomial over GF(2).

Original entry on oeis.org

1, 2, 4, 3, 5, 9, 8, 7, 11, 19, 6, 17, 10, 15, 23, 39, 13, 35, 18, 21, 31, 47, 79, 27, 16, 71, 37, 43, 63, 95, 14, 159, 55, 33, 143, 75, 22, 87, 127, 191, 38, 29, 319, 111, 67, 287, 12, 151, 45, 175, 255, 383, 77, 59, 34, 639, 223, 135, 20, 575, 30, 25, 303, 91, 351, 511, 46, 767, 155, 119, 69, 1279, 78, 447, 271, 41, 1151, 61, 51
Offset: 1

Views

Author

Antti Karttunen, Aug 02 2014

Keywords

Crossrefs

Inverse: A245702.
Similar entanglement permutations: A135141, A193231, A237427, A243287, A245703, A245704.

Programs

Formula

a(1) = 1, and for n > 1, if n is in A014580, a(n) = 2*a(A091226(n)), otherwise a(n) = 1 + 2*a(A091245(n)).
As a composition of related permutations:
a(n) = A135141(A245704(n)).
Other identities:
For all n >= 1, 1 - A000035(a(n)) = A091225(n). [Maps binary representations of irreducible GF(2) polynomials (= A014580) to even numbers and the corresponding representations of reducible polynomials to odd numbers].