A088609 -id:A088609 - cp's OEIS frontend

A243347 a(1)=1, and for n>1, if mu(n) = 0, a(n) = A005117(1+a(A057627(n))), otherwise, a(n) = A013929(a(A013928(n))).

1, 4, 12, 2, 32, 8, 84, 6, 19, 24, 220, 3, 18, 50, 63, 53, 564, 13, 9, 138, 49, 128, 162, 10, 31, 136, 38, 365, 1448, 36, 25, 5, 351, 126, 332, 30, 414, 27, 81, 82, 348, 99, 931, 103, 86, 3699, 96, 929, 21, 14, 64, 223, 16, 79, 892, 210, 325, 847, 80, 265, 1056, 72, 15, 51, 208, 212, 884, 221, 256

Offset: 1

Antti Karttunen, Jun 03 2014

nonn

Self-inverse permutation of natural numbers.

Shares with A088609 the property that after 1, positions indexed by squarefree numbers larger than one, A005117(n+1): 2, 3, 5, 6, 7, 10, 11, 13, 14, ... contain only nonsquarefree numbers A013929: 4, 8, 9, 12, 16, 18, 20, 24, ..., and vice versa. However, instead of placing terms in those subsets in monotone order this sequence recursively permutes the order of both subsets with the emerging permutation itself, thus implementing a kind of "deep" variant of A088609. Alternatively, this can be viewed as yet another "entanglement permutation", where two pairs of complementary subsets of natural numbers are interwoven with each other. In this case complementary pair A005117/A013929 is entangled with complementary pair A013929/A005117.

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

Cf. A008966, A005117, A013929, A013928, A057627, A088609, A243348.

Similar permutations: A236854, A235491, A243343-A243346, A243347, A243287-A243288, A135141-A227413, A237126-A237427, A193231.

a(1), and for n>1, if mu(n) = 0, a(n) = A005117(1+a(A057627(n))), otherwise, a(n) = A013929(a(A013928(n))). [Here mu is Moebius mu-function, A008683, which is zero only when n is a nonsquarefree number, one of the numbers in A013929.]

For all n > 1, A008966(a(n)) = 1 - A008966(n), or equally, mu(a(n)) + 1 = mu(n) modulo 2, where mu is Moebius mu (A008683). [Note: Permutation A088609 satisfies the same condition.]

A088610 Starting with n = 1, a(n) is the smallest squarefree number not included earlier if n is odd, else n is the smallest nonsquarefree number.

Original entry on oeis.org

1, 4, 2, 8, 3, 9, 5, 12, 6, 16, 7, 18, 10, 20, 11, 24, 13, 25, 14, 27, 15, 28, 17, 32, 19, 36, 21, 40, 22, 44, 23, 45, 26, 48, 29, 49, 30, 50, 31, 52, 33, 54, 34, 56, 35, 60, 37, 63, 38, 64, 39, 68, 41, 72, 42, 75, 43, 76, 46, 80, 47, 81, 51, 84, 53, 88, 55, 90, 57, 92, 58, 96

Offset: 1

Amarnath Murthy, Oct 16 2003

nonn

From Antti Karttunen, Jun 04 2014: (Start)
Squarefree (A005117) and nonsquarefree numbers (A013929) interleaved, the former at odd n and the latter at even n.
A243344 is a a "recursivized" variant of this permutation. Like this one, it also satisfies the given simple identity linking the parity of n with the Moebius mu-function. (End)

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

Inverse: A243352.
Bisections: A005117, A013929.
Similar permutations: A075378, A073846, A237056, A072061, A094077, A167151, A088609, A243344.
Cf. A000035, A008966.

With[{max = 100}, s = Select[Range[max], SquareFreeQ]; ns = Complement[Range[max], s]; Riffle[s[[1 ;; Length[ns]]], ns]] (* Amiram Eldar, Mar 04 2024 *)

(define (A088610 n) (if (even? n) (A013929 (/ n 2)) (A005117 (/ (+ 1 n) 2))))

From Antti Karttunen, Jun 04 2014: (Start)
a(2n) = A013929(n), a(2n-1) = A005117(n).
For all n, A008966(a(n)) = A000035(n), or equally, mu(a(n)) = n modulo 2, where mu is Moebius mu (A008683). (End)

More terms from Ray Chandler, Oct 18 2003

cp's OEIS Frontend

A243347 a(1)=1, and for n>1, if mu(n) = 0, a(n) = A005117(1+a(A057627(n))), otherwise, a(n) = A013929(a(A013928(n))).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A088610 Starting with n = 1, a(n) is the smallest squarefree number not included earlier if n is odd, else n is the smallest nonsquarefree number.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

Extensions