

A264965


Permutation of nonnegative integers: a(n) = A263273(A057889(n)).


13



0, 1, 2, 3, 4, 7, 6, 5, 8, 9, 10, 13, 12, 19, 22, 21, 16, 25, 18, 17, 20, 15, 26, 55, 24, 11, 14, 27, 28, 23, 30, 37, 64, 57, 46, 43, 36, 67, 70, 33, 40, 31, 66, 79, 52, 63, 38, 47, 48, 73, 58, 75, 76, 49, 54, 65, 56, 39, 34, 29, 60, 61, 74, 45, 32, 59, 42, 145, 68, 81, 226, 193, 72, 35, 82, 219, 100, 217, 174, 121, 80, 69
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

Perform an adjusted reverse of n in base 2, followed by another adjusted reverse in base 3. "Adjusted reverse" here means the digitreversing operation in which the tail of trailing zeros (in the base in question) is fixed, while the portion from the most significant digit to the least significant nonzero digit is reversed.
What percentage of the cycles are finite? (See the scatterplot and A264969, also A264972, A264973.)


LINKS

Antti Karttunen, Table of n, a(n) for n = 0..10000
Indranil Ghosh, Python program to generate the sequence


FORMULA

a(n) = A263273(A057889(n)).
Other identities. For all n >= 0:
A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.]


PROG

(Scheme) (define (A264965 n) (A263273 (A057889 n)))


CROSSREFS

Inverse: A264966.
Cf. A000035, A057889, A263273, A264969, A264972, A264973.
Cf. also A264967, A264968.
Sequence in context: A077223 A265369 A267308 * A266644 A329411 A055265
Adjacent sequences: A264962 A264963 A264964 * A264966 A264967 A264968


KEYWORD

nonn,base,look


AUTHOR

Antti Karttunen, Dec 05 2015


STATUS

approved



