

A246375


Permutation of natural numbers: a(1) = 1, a(2n) = 2*a(n), a(2n+1) = A003961(1+a(n)). [Where A003961(n) shifts the prime factorization of n one step towards larger primes].


8



1, 2, 3, 4, 5, 6, 9, 8, 7, 10, 15, 12, 11, 18, 21, 16, 25, 14, 27, 20, 13, 30, 81, 24, 17, 22, 45, 36, 23, 42, 39, 32, 19, 50, 51, 28, 35, 54, 99, 40, 55, 26, 33, 60, 37, 162, 129, 48, 49, 34, 75, 44, 29, 90, 87, 72, 41, 46, 135, 84, 47, 78, 189, 64, 65, 38, 63, 100, 95, 102, 153, 56, 31, 70
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

This can be viewed as yet another "entanglement permutation" where the two complementary pairs to be interwoven together are even and odd numbers (A005843/A005408) which are entangled with the complementary pair even numbers (taken straight) and odd numbers in the order they appear in A003961: (A005843/A003961). Sequence A163511 has almost the same definition, but its domain starts from 0, which results a different permutation.


LINKS



FORMULA

a(1) = 1, a(2n) = 2*a(n), a(2n+1) = A003961(1+a(n)). [Where A003961(n) shifts the prime factorization of n one step towards larger primes].
As a composition of related permutations:
Other identities. For all n >= 1 the following holds:


PROG

(PARI)
default(primelimit, (2^31)+(2^30));
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ Using code of Michel Marcus
for(n=1, 16384, write("b246375.txt", n, " ", A246375(n)));
(Scheme, with memoizing definecmacro)


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



