A260436 Permutation mapping from Ludic sieve to Lucky sieve: a(1) = 1, for n > 1: a(n) = A255551(A260738(n), A260739(n)).

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

Offset: 1

Author

Antti Karttunen, Jul 30 2015

Keywords

• nonn

Comments

a(n) tells which number in array A255551 (constructed from Lucky sieve) is at the same position where n is in array A255127 (constructed from Ludic sieve). This permutation fixes all even numbers because both arrays have A005843 as their topmost row.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10105
• Index entries for sequences that are permutations of the natural numbers
• Index entries for sequences generated by sieves

Crossrefs

Inverse: A260435.

Cf. A000959, A003309, A255551, A260738, A260739.

Similar permutations: A255408, A255128, A255551, A255553, A249817, A249818, A260742 (a more recursed variant).

Programs

Scheme

(define (A260436 n) (if (<= n 1) n (A255551bi (A260738 n) (A260739 n)))) ;; Code for A255551bi given in A255551.

Formula

Other identities. For all n >= 1:

a(A003309(n+2)) = A000959(n+1). [Maps odd Ludic numbers to Lucky numbers.]

a(2n) = 2n.

As a composition of related permutations:

a(n) = A255551(A255128(n)).

a(n) = A255553(A255408(n)).