A243288 -id:A243288 - cp's OEIS frontend

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

1, 2, 4, 3, 5, 11, 8, 7, 6, 13, 9, 47, 17, 31, 14, 25, 12, 19, 10, 59, 20, 37, 15, 319, 62, 87, 24, 185, 42, 61, 21, 137, 34, 55, 18, 97, 27, 41, 16, 415, 76, 103, 28, 229, 49, 67, 22, 3053, 373, 433, 79, 647, 108, 131, 33, 1627, 222, 283, 54, 425, 78, 109, 29, 1123, 166, 203, 45, 379, 71, 91, 26, 731, 121, 145, 36, 253, 53, 73, 23

Offset: 1

Antti Karttunen, Aug 02 2014

nonn

Inverse: A245701.
Cf. A000035, A014580, A091242, A091225.
Similar entanglement permutations: A193231, A227413, A237126, A243288, A245703, A245704.

allocatemem(123456789);
a014580 = vector(2^18);
a091242 = vector(2^22);
isA014580(n)=polisirreducible(Pol(binary(n))*Mod(1, 2)); \\ This function from Charles R Greathouse IV
i=0; j=0; n=2; while((n < 2^22), if(isA014580(n), i++; a014580[i] = n, j++; a091242[j] = n); n++)
A245702(n) = if(1==n, 1, if(0==(n%2), a014580[A245702(n/2)], a091242[A245702((n-1)/2)]));
for(n=1, 383, write("b245702.txt", n, " ", A245702(n)));

;; With memoizing definec-macro.
(definec (A245702 n) (cond ((< n 2) n) ((even? n) (A014580 (A245702 (/ n 2)))) (else (A091242 (A245702 (/ (- n 1) 2))))))

a(1) = 1, a(2n) = A014580(a(n)), a(2n+1) = A091242(a(n)).
As a composition of related permutations:
a(n) = A245703(A227413(n)).
Other identities:
For all n >= 1, 1 - A091225(a(n)) = A000035(n). [Maps even numbers to binary representations of irreducible GF(2) polynomials (= A014580) and odd numbers to the corresponding representations of reducible polynomials].

A245614 Permutation of natural numbers: a(1)=1; thereafter, if n is k-th number whose greatest prime factor has an odd index [i.e., n = A244991(k)], a(n) = A026424(a(k)), otherwise, when n is k-th number whose greatest prime factor has an even index [i.e., n = A244990(1+k)], a(n) = A028260(1+a(k)).

Original entry on oeis.org

1, 2, 4, 3, 7, 6, 10, 5, 9, 12, 11, 16, 15, 24, 18, 8, 17, 14, 22, 20, 26, 19, 29, 25, 28, 36, 35, 55, 39, 44, 31, 13, 30, 27, 21, 38, 34, 51, 46, 42, 37, 57, 40, 47, 32, 52, 45, 62, 56, 50, 68, 60, 82, 81, 67, 121, 86, 93, 105, 72, 65, 79, 33, 59, 64, 23, 53, 48, 41, 58, 49, 85, 71, 77, 66, 111, 99

Offset: 1

Antti Karttunen, Jul 27 2014

This shares with the permutation A122111 the property that each term of A244990 is mapped to a unique term of A028260 and each term of A244991 is mapped to a unique term of A026424.

Antti Karttunen, Table of n, a(n) for n = 1..10001
Index entries for sequences that are permutations of the natural numbers

Inverse: A245613.
Cf. A026424, A028260, A066829, A244988, A244989, A244990, A244991, A244992, A122111.
Similar permutations: A244321, A244322, A245604, A227413, A237126, A243288, A243344, A243346, A245606.

a(1) = 1, and for n > 1, if A244992(n) = 1, a(n) = A026424(a(A244989(n))), otherwise a(n) = A028260(1+a(A244988(n)-1)).
As a composition of related permutations:
a(n) = A245604(A244321(n)).
For all n >= 1, A244992(n) = A066829(a(n)).

A252758 Permutation of natural numbers: a(1) = 1, a(2n) = A251726(a(n)), a(2n+1) = A251727(a(n)).

Original entry on oeis.org

1, 2, 10, 3, 14, 12, 38, 4, 20, 17, 44, 15, 40, 61, 92, 5, 22, 25, 57, 21, 51, 72, 102, 18, 46, 64, 94, 108, 132, 191, 182, 6, 26, 29, 60, 35, 68, 101, 124, 27, 58, 85, 116, 135, 152, 221, 198, 23, 52, 75, 106, 115, 138, 193, 184, 239, 206, 311, 242, 499, 333, 467, 318, 7, 28, 36, 69, 43, 76, 107, 130, 54, 87, 127, 145, 217, 196, 283, 231, 37

Offset: 1

Antti Karttunen, Jan 02 2015

nonn

Antti Karttunen, Table of n, a(n) for n = 1..959
Index entries for sequences that are permutations of the natural numbers

Inverse: A252757.
Similar permutations: A243288, A227413, A237126.
Cf. A251726, A251727.

a(1) = 1, a(2n) = A251726(a(n)), a(2n+1) = A251727(a(n)).

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Scheme

Formula

A245614 Permutation of natural numbers: a(1)=1; thereafter, if n is k-th number whose greatest prime factor has an odd index [i.e., n = A244991(k)], a(n) = A026424(a(k)), otherwise, when n is k-th number whose greatest prime factor has an even index [i.e., n = A244990(1+k)], a(n) = A028260(1+a(k)).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A252758 Permutation of natural numbers: a(1) = 1, a(2n) = A251726(a(n)), a(2n+1) = A251727(a(n)).

Views

Author

Keywords

Links

Crossrefs

Formula