A260435 Permutation mapping from Lucky sieve to Ludic sieve: a(1) = 1, for n > 1: a(n) = A255127(A260438(n), A260439(n)).

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

Offset

1,2

Comments

a(n) tells which number in array A255127 (constructed from Ludic sieve) is at the same position where n is in array A255551 (constructed from Lucky 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..10104

Index entries for sequences that are permutations of the natural numbers

Index entries for sequences generated by sieves

Formula

Other identities. For all n >= 1:

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

a(2n) = 2n.

As a composition of related permutations:

a(n) = A255127(A255552(n)).

a(n) = A255407(A255554(n)).

Prog

(Scheme) (define (A260435 n) (if (<= n 1) n (A255127bi (A260438 n) (A260439 n)))) ;; Code for A255127bi given in A255127.

Crossrefs

Inverse: A260436.

Cf. A000959, A003309, A255127, A260438, A260439.

Similar or related permutations: A255407, A255552, A255554, A249817, A249818, A260741 (a more recursed variant).

Sequence in context: A112480 A298196 A112095 * A255554 A260741 A091203

Adjacent sequences: A260432 A260433 A260434 * A260436 A260437 A260438

Keyword

nonn

Author

Antti Karttunen, Jul 30 2015

Status

approved