cp's OEIS Frontend

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

%I A260436 #15 Aug 02 2015 17:53:24
%S A260436 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,
%T A260436 23,28,33,30,27,32,29,34,39,36,37,38,35,40,43,42,49,44,41,46,51,48,61,
%U A260436 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
%N A260436 Permutation mapping from Ludic sieve to Lucky sieve: a(1) = 1, for n > 1: a(n) = A255551(A260738(n), A260739(n)).
%C A260436 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.
%H A260436 Antti Karttunen, <a href="/A260436/b260436.txt">Table of n, a(n) for n = 1..10105</a>
%H A260436 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%H A260436 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%F A260436 Other identities. For all n >= 1:
%F A260436 a(A003309(n+2)) = A000959(n+1). [Maps odd Ludic numbers to Lucky numbers.]
%F A260436 a(2n) = 2n.
%F A260436 As a composition of related permutations:
%F A260436 a(n) = A255551(A255128(n)).
%F A260436 a(n) = A255553(A255408(n)).
%o A260436 (Scheme) (define (A260436 n) (if (<= n 1) n (A255551bi (A260738 n) (A260739 n)))) ;; Code for A255551bi given in A255551.
%Y A260436 Inverse: A260435.
%Y A260436 Cf. A000959, A003309, A255551, A260738, A260739.
%Y A260436 Similar permutations: A255408, A255128, A255551, A255553, A249817, A249818, A260742 (a more recursed variant).
%K A260436 nonn
%O A260436 1,2
%A A260436 _Antti Karttunen_, Jul 30 2015