A246367 -id:A246367 - cp's OEIS frontend

A246363 Permutation of natural numbers: a(n) = A135141(A048673(n)).

1, 2, 4, 8, 3, 9, 5, 13, 10, 16, 6, 14, 7, 12, 35, 20, 17, 79, 11, 67, 71, 33, 19, 271, 39, 31, 139, 87, 15, 30, 18, 311, 47, 34, 63, 74, 23, 29, 26, 351, 21, 28, 27, 24, 303, 69, 25, 2431, 70, 223, 135, 319, 37, 1663, 65, 58, 41, 38, 32, 219, 43, 127, 367, 327, 287, 239, 55, 107, 46, 283, 22, 413, 51, 53, 147

Offset: 1

Antti Karttunen, Aug 26 2014

nonn

Apart from 2, even numbers occur only in positions given by A246261 (together with some odd numbers).

Also, apart from A246263(1) = 2, the positions given by the rest of A246263: 5, 6, 7, 8, 15, 17, 18, 19, 20, 21, ... contain odd numbers only.

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

Inverse: A246364.
Related or similar permutations: A048673, A135141, A246365, A246367.
Cf. A000035, A003961, A246260, A246261, A246263.

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
A048673(n) = (A003961(n)+1)/2;
A135141(n) = if(1==n, 1, if(isprime(n), 2*A135141(primepi(n)), 1+(2*A135141(n-primepi(n)-1))));
A246363(n) = A135141(A048673(n));
for(n=1, 10000, write("b246363.txt", n, " ", A246363(n)));

(define (A246363 n) (A135141 (A048673 n)))

a(n) = A135141(A048673(n)).

A246368 Permutation of natural numbers: a(n) = A227413(A005941(n)).

Original entry on oeis.org

1, 2, 4, 3, 6, 7, 8, 5, 9, 13, 10, 17, 20, 19, 12, 11, 46, 23, 166, 41, 15, 29, 858, 59, 14, 71, 16, 67, 6186, 37, 58645, 31, 18, 199, 22, 83, 705348, 983, 32, 179, 10428487, 47, 184718194, 109, 21, 6659, 3840230006, 277, 27, 43, 65, 353

Offset: 1

Antti Karttunen, Aug 26 2014

nonn

Index entries for sequences that are permutations of the natural numbers

Inverse: A246367.
Similar or related permutations: A005941, A156552, A227413, A246364, A246366.
Cf. A000035, A010051.

default(primelimit,(2^31)+(2^30));
A002808(n) = { my(k=-1); while( -n + n += -k + k=primepi(n), ); n }; \\ This function from M. F. Hasler
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
A156552(n) = if(1==n, 0, if(!(n%2), 1+(2*A156552(n/2)), 2*A156552(A064989(n))));
A005941(n) = A156552(n)+1;
A227413(n) = if(1==n, 1, if(!(n%2), prime(A227413(n/2)), A002808(A227413((n-1)/2))));
A246368(n) = A227413(A005941(n));
for(n=1, 52, write("b246368.txt", n, " ", A246368(n)));

(define (A246368 n) (A227413 (A005941 n)))

a(n) = A227413(A005941(n)) = A227413(1+A156552(n)).
Other identities:
For all n >= 1,  A010051(a(n)) = 1 - A000035(n). [This permutation maps even numbers to primes and odd numbers to nonprimes, in some order, because the permutation A227413 has the same property and A005941 preserves the parity].

A246681 Permutation of natural numbers: a(0) = 1, a(1) = 2, a(p_n) = A003961(a(n)), a(c_n) = 2*a(n), where p_n = n-th prime = A000040(n), c_n = n-th composite number = A002808(n), and A003961(n) shifts the prime factorization of n one step towards larger primes.

Original entry on oeis.org

1, 2, 3, 5, 4, 7, 6, 9, 10, 8, 14, 11, 12, 15, 18, 20, 16, 25, 28, 21, 22, 24, 30, 27, 36, 40, 32, 50, 56, 33, 42, 13, 44, 48, 60, 54, 72, 45, 80, 64, 100, 35, 112, 75, 66, 84, 26, 63, 88, 96, 120, 108, 144, 81, 90, 160, 128, 200, 70, 49, 224, 99, 150, 132, 168, 52, 126, 55, 176, 192, 240, 39

Offset: 0

Antti Karttunen, Sep 01 2014

Note the indexing: the domain starts from 0, while the range excludes zero.
Iterating a(n) from n=0 gives the sequence: 1, 2, 3, 5, 7, 9, 8, 10, 14, 18, 28, 56, 128, 156, 1344, 16524, 2706412500, ..., which is the only one-way cycle of this permutation.
Because 2 is the only even prime, it implies that, apart from a(0)=1 and a(2)=3, odd numbers occur in odd positions only (along with many even numbers that also occur in odd positions). This in turn implies that there exists an infinite number of infinite cycles like (... 648391 31 13 15 20 22 30 42 112 196 1350 ...) which contain just one odd composite (A071904). Apart from 9 which is in that one-way cycle, each odd composite occurs in a separate infinite two-way cycle, like 15 in the example above.

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

Inverse: A246682.
Similar or related permutations: A163511, A246377, A246379, A246367, A245821.
Cf. A000040, A000720, A003961, A007097, A010051, A065855, A071904, A078442, A049076, A055396.

a(0) = 1, a(1) = 2, and for n > 1, if A010051(n) = 1 [i.e. when n is a prime], a(n) = A003961(a(A000720(n))), otherwise a(n) = 2*a(A065855(n)).
Other identities.
For all n >= 0, the following holds:
a(A007097(n)) = A000040(n+1). [Maps the iterates of primes to primes].
A078442(a(n)) > 0 if and only if n is in A007097. [Follows from above].
For all n >= 1, the following holds:
a(n) = A163511(A246377(n)).
A000035(a(n)) = A010051(n). [Maps primes to odd numbers > 1, and composites to even numbers, in some order. Permutations A246377 & A246379 have the same property].
A055396(a(n)) = A049076(n). [An "order of primeness" is mapped to the index of the smallest prime dividing n].

A246365 Permutation of natural numbers: a(n) = A135141(A005940(n)).

Original entry on oeis.org

1, 2, 4, 3, 8, 5, 7, 9, 6, 17, 19, 11, 39, 35, 25, 15, 16, 13, 23, 33, 29, 37, 75, 27, 95, 87, 61, 55, 767, 45, 83, 67, 10, 21, 47, 71, 159, 143, 139, 51, 319, 175, 639, 287, 251, 263, 247, 135, 527, 239, 199, 447, 105, 115, 991, 119, 1015, 443, 4575, 85, 583, 2175, 1343, 151, 12, 31, 63, 69, 131, 77

Offset: 1

Antti Karttunen, Aug 26 2014

nonn

Even terms occur at the positions 2^n + 1 (A000051), in some order, and the odd terms everywhere else.

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

Inverse: A246366.
Related or similar permutations: A005940, A135141, A246363, A246367.
Cf. A000051, A003961.

default(primelimit,(2^31)+(2^30));
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ Modified from code of M. F. Hasler
A135141(n) = if(1==n, 1, if(isprime(n), 2*A135141(primepi(n)), 1+(2*A135141(n-primepi(n)-1))));
A246365(n) = A135141(A005940(n));
for(n=1, 10000, write("b246365.txt", n, " ", A246365(n)));

(define (A246365 n) (A135141 (A005940 n)))

a(n) = A135141(A005940(n)).

A246379 Permutation of natural numbers: a(1) = 1, a(p_n) = A003961(1+a(n)), a(c_n) = 2*a(n), where p_n = n-th prime = A000040(n), c_n = n-th composite number = A002808(n), and A003961(n) shifts the prime factorization of n one step towards larger primes.

Original entry on oeis.org

1, 3, 9, 2, 21, 6, 5, 18, 4, 42, 39, 12, 11, 10, 36, 8, 15, 84, 23, 78, 24, 22, 7, 20, 72, 16, 30, 168, 47, 46, 189, 156, 48, 44, 14, 40, 17, 144, 32, 60, 45, 336, 13, 94, 92, 378, 41, 312, 96, 88, 28, 80, 25, 34, 288, 64, 120, 90, 81, 672, 133, 26, 188, 184, 756, 82, 135, 624, 192, 176, 83, 56, 49

Offset: 1

Antti Karttunen, Aug 29 2014

nonn

Because 2 is the only even prime, it implies that, apart from a(2)=3, odd numbers occur in odd positions only (along with many even numbers that also occur in odd positions). This in turn implies that each odd composite (A071904) resides in a separate infinite cycle in this permutation, except 9, which is in a finite cycle (2 3 9 4).

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

Inverse: A246380.
Similar or related permutations: A246375, A246377, A246363, A246364, A246365, A246367, A246681.
Cf. A000720, A003961, A010051, A065855, A071904.

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
A246379(n) = if(1==n, 1, if(isprime(n), A003961(1+A246379(primepi(n))), 2*A246379(n-primepi(n)-1)));
for(n=1, 10000, write("b246379.txt", n, " ", A246379(n)));
(Scheme, with memoization-macro definec)
(definec (A246379 n) (cond ((< n 2) n) ((= 1 (A010051 n)) (A003961 (+ 1 (A246379 (A000720 n))))) (else (* 2 (A246379 (A065855 n))))))

a(1) = 1, and for n > 1, if A010051(n) = 1 [i.e. when n is a prime], a(n) = A003961(1+a(A000720(n))), otherwise a(n) = 2*a(A065855(n)).
As a composition of related permutations:
a(n) = A246375(A246377(n)).
Other identities. For all n > 1 the following holds:
A000035(a(n)) = A010051(n). [Maps primes to odd numbers > 1, and composites to even numbers, in some order. Permutations A246377 & A246681 have the same property].

cp's OEIS Frontend

A246363 Permutation of natural numbers: a(n) = A135141(A048673(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Scheme

Formula

A246368 Permutation of natural numbers: a(n) = A227413(A005941(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Scheme

Formula

A246681 Permutation of natural numbers: a(0) = 1, a(1) = 2, a(p_n) = A003961(a(n)), a(c_n) = 2*a(n), where p_n = n-th prime = A000040(n), c_n = n-th composite number = A002808(n), and A003961(n) shifts the prime factorization of n one step towards larger primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A246365 Permutation of natural numbers: a(n) = A135141(A005940(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Scheme

Formula

A246379 Permutation of natural numbers: a(1) = 1, a(p_n) = A003961(1+a(n)), a(c_n) = 2*a(n), where p_n = n-th prime = A000040(n), c_n = n-th composite number = A002808(n), and A003961(n) shifts the prime factorization of n one step towards larger primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula