A263272 -id:A263272 - cp's OEIS frontend

A264987 Odd bisection of A263272.

1, 3, 5, 11, 9, 7, 13, 15, 23, 29, 33, 17, 35, 27, 19, 37, 21, 25, 31, 39, 41, 95, 45, 59, 113, 69, 77, 83, 87, 47, 101, 99, 65, 119, 51, 71, 89, 105, 53, 107, 81, 55, 109, 57, 73, 91, 111, 43, 97, 63, 61, 115, 75, 79, 85, 93, 49, 103, 117, 67, 121, 123, 203, 257, 285, 149, 311, 135, 167, 329, 177, 221, 275

Offset: 0

Antti Karttunen, Dec 05 2015

nonn

Cf. A263272, A264986, A264989.

from sympy import factorint
from sympy.ntheory.factor_ import digits
from operator import mul
def a030102(n): return 0 if n==0 else int(''.join(map(str, digits(n, 3)[1:][::-1])), 3)
def a038502(n):
    f=factorint(n)
    return 1 if n==1 else reduce(mul, [1 if i==3 else i**f[i] for i in f])
def a038500(n): return n/a038502(n)
def a263273(n): return 0 if n==0 else a030102(a038502(n))*a038500(n)
def a(n): return a263273(2*(2*n + 1))/2 # Indranil Ghosh, May 23 2017

(define (A264987 n) (A263272 (+ 1 n n)))

a(n) = A263272((2*n)+1).

A265357 Permutation of nonnegative integers: a(n) = A264989(A263272(n)).

Original entry on oeis.org

0, 1, 2, 5, 4, 3, 6, 8, 11, 14, 16, 7, 17, 13, 9, 18, 32, 29, 15, 23, 20, 59, 26, 12, 56, 35, 38, 41, 43, 19, 50, 52, 10, 47, 25, 34, 44, 49, 22, 53, 40, 27, 54, 86, 83, 45, 95, 33, 167, 98, 30, 164, 89, 92, 42, 68, 24, 176, 71, 21, 60, 62, 65, 140, 77, 74, 179, 80, 36, 57, 113, 110, 137, 104, 101, 170, 107, 39, 173, 116, 119, 122

Offset: 0

Antti Karttunen, Dec 07 2015

Composition of A263272 with the permutation obtained from its odd bisection.

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

Inverse: A265358.
Cf. A263272, A264989.
Cf. also A265351, A265352, A265353, A265354, A265355, A265356.

(define (A265357 n) (A264989 (A263272 n)))

a(n) = A264989(A263272(n)).

A265358 Permutation of nonnegative integers: a(n) = A263272(A264989(n)).

Original entry on oeis.org

0, 1, 2, 5, 4, 3, 6, 11, 7, 14, 32, 8, 23, 13, 9, 18, 10, 12, 15, 29, 20, 59, 38, 19, 56, 34, 22, 41, 95, 17, 50, 113, 16, 47, 35, 25, 68, 104, 26, 77, 40, 27, 54, 28, 36, 45, 83, 33, 96, 37, 30, 87, 31, 39, 42, 86, 24, 69, 110, 21, 60, 101, 61, 176, 302, 62, 185, 119, 55, 164, 100, 58, 167, 299, 65, 194, 115, 64, 191, 103, 67, 122

Offset: 0

Antti Karttunen, Dec 07 2015

Composition of A263272 with the permutation obtained from its odd bisection.

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

Inverse: A265357.
Cf. A263272, A264989.
Cf. also A265351, A265352, A265353, A265354, A265355, A265356.
Cf. A265361, A265362.

(define (A265358 n) (A263272 (A264989 n)))

a(n) = A263272(A264989(n)).

A265343 Permutation of nonnegative integers: a(n) = A264978(A263272(n)).

Original entry on oeis.org

0, 1, 2, 3, 8, 5, 6, 17, 4, 9, 10, 7, 24, 26, 14, 15, 44, 16, 18, 19, 20, 51, 53, 11, 12, 35, 13, 27, 28, 29, 30, 89, 23, 21, 62, 22, 72, 71, 25, 78, 80, 41, 42, 125, 43, 45, 46, 47, 132, 134, 50, 48, 143, 49, 54, 55, 56, 57, 170, 59, 60, 179, 58, 153, 152, 52, 159, 161, 32, 33, 98, 31, 36, 37, 34, 105, 107, 38, 39, 116, 40, 81

Offset: 0

Antti Karttunen, Dec 07 2015

Composition of A263272 with the permutation obtained from its quadrisection. Equally: composition of permutations that are obtained from the bisection and octisection of A263273.

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

Inverse: A265344.
Cf. A263272, A263273, A264978.
Cf. also A265363.

(define (A265343 n) (A264978 (A263272 n)))

a(n) = A264978(A263272(n)).
Other identities. For all n >= 0:
a(3*n) = 3*a(n).

A265344 Permutation of nonnegative integers: a(n) = A263272(A264978(n)).

Original entry on oeis.org

0, 1, 2, 3, 8, 5, 6, 11, 4, 9, 10, 23, 24, 26, 14, 15, 17, 7, 18, 19, 20, 33, 35, 32, 12, 38, 13, 27, 28, 29, 30, 71, 68, 69, 74, 25, 72, 73, 77, 78, 80, 41, 42, 44, 16, 45, 46, 47, 51, 53, 50, 21, 65, 22, 54, 55, 56, 57, 62, 59, 60, 101, 34, 99, 100, 104, 105, 107, 95, 96, 98, 37, 36, 109, 110, 114, 116, 113, 39, 119, 40, 81

Offset: 0

Antti Karttunen, Dec 07 2015

Composition of A263272 with the permutation obtained from its quadrisection. Equally: composition of permutations that are obtained from the bisection and octisection of A263273.

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

Inverse: A265343.
Cf. A263272, A263273, A264978.
Cf. also A265364.

(define (A265344 n) (A263272 (A264978 n)))

a(n) = A263272(A264978(n)).
Other identities. For all n >= 0:
a(3*n) = 3*a(n).

A265367 Permutation of nonnegative integers: a(n) = A264974(A263272(A263273(n))).

Original entry on oeis.org

0, 1, 2, 3, 4, 19, 6, 5, 16, 9, 10, 55, 12, 13, 58, 57, 46, 49, 18, 7, 20, 15, 14, 17, 48, 43, 52, 27, 28, 163, 30, 37, 172, 165, 136, 145, 36, 31, 166, 39, 40, 175, 174, 139, 148, 171, 22, 181, 138, 127, 154, 147, 130, 157, 54, 11, 56, 21, 34, 169, 60, 47, 142, 45, 8, 59, 42, 41, 50, 51, 44, 53, 144, 25, 178, 129, 124, 151, 156, 133, 160, 81

Offset: 0

Antti Karttunen, Dec 07 2015

nonn

Composition of A263273 with the permutations obtained from its bisection (A263272) and quadrisection (A264974), in that order from right to left.

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

Inverse: A265368.

Cf. A263272, A263273, A264974, A264975, A265351.

(define (A265367 n) (A264974 (A263272 (A263273 n))))

a(n) = A264974(A263272(A263273(n))).
As a composition of other related permutations:
a(n) = A264974(A265351(n)).
a(n) = A264975(A263273(n)).
Other identities. For all n >= 0:
a(3*n) = 3*a(n).

A265368 Permutation of nonnegative integers: a(n) = A263273(A263272(A264974(n))).

Original entry on oeis.org

0, 1, 2, 3, 4, 7, 6, 19, 64, 9, 10, 55, 12, 13, 22, 21, 8, 23, 18, 5, 20, 57, 46, 199, 192, 73, 208, 27, 28, 163, 30, 37, 190, 165, 58, 193, 36, 31, 166, 39, 40, 67, 66, 25, 70, 63, 16, 61, 24, 17, 68, 69, 26, 71, 54, 11, 56, 15, 14, 65, 60, 181, 586, 171, 100, 505, 138, 127, 604, 597, 226, 631, 576, 145, 550, 219, 154, 613, 624, 235, 640, 81

Offset: 0

Antti Karttunen, Dec 07 2015

Composition of A263273 with the permutations obtained from its bisection (A263272) and quadrisection (A264974), in that order from left to right.

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

Inverse: A265367.

Cf. A263272, A263273, A264974, A264976, A265352.

(define (A265368 n) (A263273 (A263272 (A264974 n))))

a(n) = A263273(A263272(A264974(n))).
As a composition of other related permutations:
a(n) = A265352(A264974(n)).
a(n) = A263273(A264976(n)).
Other identities. For all n >= 0:
a(3*n) = 3*a(n).

A265902 Self-inverse permutation of nonnegative integers: a(n) = A263273(A263272(A263273(n))).

Original entry on oeis.org

0, 1, 2, 3, 4, 19, 6, 7, 8, 9, 10, 55, 12, 13, 58, 57, 64, 73, 18, 5, 20, 21, 22, 25, 24, 23, 26, 27, 28, 163, 30, 37, 172, 165, 190, 217, 36, 31, 166, 39, 40, 175, 174, 193, 220, 171, 46, 181, 192, 199, 226, 219, 208, 235, 54, 11, 56, 15, 14, 59, 60, 65, 74, 63, 16, 61, 66, 67, 76, 75, 70

Offset: 0

Antti Karttunen, Jan 02 2016

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

Cf. A000035, A263272, A263273, A265351, A265352.

Cf. also A265904, A266189.

f[n_] := Block[{g, h}, g[x_] := x/3^IntegerExponent[x, 3]; h[x_] := x/g@ x; If[n == 0, 0, FromDigits[Reverse@ IntegerDigits[#, 3], 3] &@ g[n] h[n]]]; t = Table[f[2 n]/2, {n, 0, 1000}]; Table[f[t[[f@ n + 1]]], {n, 0, 83}] (* Michael De Vlieger, Jan 04 2016, after Jean-François Alcover at A263273 *)

(define (A265902 n) (A263273 (A263272 (A263273 n))))

a(n) = A263273(A263272(A263273(n))).
As a composition of related permutations:
a(n) = A263273(A265351(n)).
a(n) = A265352(A263273(n)).
Other identities. For all n >= 0:
a(3*n) = 3*a(n).
A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.]

A263273 Bijective base-3 reverse: a(0) = 0; for n >= 1, a(n) = A030102(A038502(n)) * A038500(n).

Original entry on oeis.org

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

Offset: 0

Antti Karttunen, Dec 05 2015

Here the base-3 reverse has been adjusted so that the maximal suffix of trailing zeros (in base-3 representation A007089) stays where it is at the right side, and only the section from the most significant digit to the least significant nonzero digit is reversed, thus making this sequence a self-inverse permutation of nonnegative integers.
Because successive powers of 3 and 9 modulo 2, 4 and 8 are always either constant 1, 1, 1, ... or alternating 1, -1, 1, -1, ... it implies similar simple divisibility rules for 2, 4 and 8 in base 3 as e.g. 3, 9 and 11 have in decimal base (see the Wikipedia-link). As these rules do not depend on which direction they are applied from, it means that this bijection preserves the fact whether a number is divisible by 2, 4 or 8, or whether it is not. Thus natural numbers are divided to several subsets, each of which is closed with respect to this bijection. See the Crossrefs section for permutations obtained from these sections.
When polynomials over GF(3) are encoded as natural numbers (coefficients presented with the digits of the base-3 expansion of n), this bijection works as a multiplicative automorphism of the ring GF(3)[X]. This follows from the fact that as there are no carries involved, the multiplication (and thus also the division) of such polynomials could be as well performed by temporarily reversing all factors (like they were seen through mirror). This implies also that the sequences A207669 and A207670 are closed with respect to this bijection.

			For n = 15, A007089(15) = 120. Reversing this so that the trailing zero stays at the right yields 210 = A007089(21), thus a(15) = 21 and vice versa, a(21) = 15.

Antti Karttunen, Table of n, a(n) for n = 0..6561
Wikipedia, Divisibility rule
Index entries for sequences that are permutations of the natural numbers

Bisections: A264983, A264984.
Cf. A000035, A007089, A010873, A030102, A038500, A038502, A207669, A207670.
Cf. also A057889, A264965, A264966, A264980.
Permutations induced by various sections: A263272 (a(2n)/2), A264974 (a(4n)/4), A264978 (a(8n)/8), A264985, A264989.
Cf. also A004488, A140263, A140264, A246207, A246208 (other base-3 related permutations).

r[n_] := FromDigits[Reverse[IntegerDigits[n, 3]], 3]; b[n_] := n/ 3^IntegerExponent[n, 3]; c[n_] := n/b[n]; a[0]=0; a[n_] := r[b[n]]*c[n]; Table[a[n], {n, 0, 80}] (* Jean-François Alcover, Dec 29 2015 *)

from sympy import factorint
from sympy.ntheory.factor_ import digits
from operator import mul
def a030102(n): return 0 if n==0 else int(''.join(map(str, digits(n, 3)[1:][::-1])), 3)
def a038502(n):
    f=factorint(n)
    return 1 if n==1 else reduce(mul, [1 if i==3 else i**f[i] for i in f])
def a038500(n): return n/a038502(n)
def a(n): return 0 if n==0 else a030102(a038502(n))*a038500(n) # Indranil Ghosh, May 22 2017

(define (A263273 n) (if (zero? n) n (* (A030102 (A038502 n)) (A038500 n))))

a(0) = 0; for n >= 1, a(n) = A030102(A038502(n)) * A038500(n).
Other identities. For all n >= 0:
a(3*n) = 3*a(n).
A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.]
A010873(a(n)) = 0 if and only if A010873(n) = 0. [See the comments section.]

A264974 Self-inverse permutation of natural numbers: a(n) = A263273(4*n) / 4.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 16, 9, 10, 19, 12, 13, 14, 15, 8, 17, 18, 11, 20, 21, 34, 43, 48, 25, 52, 27, 28, 55, 30, 37, 46, 57, 22, 49, 36, 31, 58, 39, 40, 41, 42, 23, 50, 45, 32, 59, 24, 35, 44, 51, 26, 53, 54, 29, 56, 33, 38, 47, 60, 61, 142, 63, 88, 169, 102, 115, 124, 129, 70, 151, 144, 97, 178, 75, 106, 133, 156, 79, 160, 81

Offset: 0

Antti Karttunen, Dec 05 2015

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

Terms of A264986 halved.
Cf. A263272, A263273, A264978.
Cf. also A264975, A264976.

from sympy import factorint
from sympy.ntheory.factor_ import digits
from operator import mul
def a030102(n): return 0 if n==0 else int(''.join(map(str, digits(n, 3)[1:][::-1])), 3)
def a038502(n):
    f=factorint(n)
    return 1 if n==1 else reduce(mul, [1 if i==3 else i**f[i] for i in f])
def a038500(n): return n/a038502(n)
def a263273(n): return 0 if n==0 else a030102(a038502(n))*a038500(n)
def a(n): return a263273(4*n)/4 # Indranil Ghosh, May 25 2017

a(n) = A263273(4*n) / 4.
a(n) = A264986(n) / 2 = A263272(2*n) / 2.
As a composition of related permutations:
a(n) = A264975(A263272(n)) = A263272(A264976(n)).
Other identities. For all n >= 0:
a(3*n) = 3*a(n).
A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.]
A264978(n) = a(2n)/2. [Thus the restriction onto even numbers induces yet another permutation.]

cp's OEIS Frontend

A264987 Odd bisection of A263272.

Views

Author

Keywords

Crossrefs

Programs

Python

Scheme

Formula

A265357 Permutation of nonnegative integers: a(n) = A264989(A263272(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A265358 Permutation of nonnegative integers: a(n) = A263272(A264989(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A265343 Permutation of nonnegative integers: a(n) = A264978(A263272(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A265344 Permutation of nonnegative integers: a(n) = A263272(A264978(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A265367 Permutation of nonnegative integers: a(n) = A264974(A263272(A263273(n))).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A265368 Permutation of nonnegative integers: a(n) = A263273(A263272(A264974(n))).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A265902 Self-inverse permutation of nonnegative integers: a(n) = A263273(A263272(A263273(n))).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Scheme

Formula