This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A260742 #8 Aug 02 2015 17:55:15 %S A260742 1,2,3,4,7,6,9,8,5,14,13,12,15,18,11,16,21,10,19,28,17,26,25,24,31,30, %T A260742 35,36,33,22,27,32,29,42,39,20,37,38,47,56,43,34,49,52,41,50,51,48,61, %U A260742 62,23,60,63,70,45,72,77,66,57,44,67,54,71,64,123,58,69,84,65,78,73,40,55,74,83,76,75,94,103,112,101,86,79,68,91,98,59,104,87,82,93,100,89,102 %N A260742 Permutation of natural numbers: a(1) = 1, for n > 1: a(n) = A255551(A260738(n), a(A260739(n))). %C A260742 This is a more recursed variant of A260436. %H A260742 Antti Karttunen, <a href="/A260742/b260742.txt">Table of n, a(n) for n = 1..10104</a> %H A260742 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A260742 a(1) = 1, for n > 1: a(n) = A255551(A260738(n), a(A260739(n))). %F A260742 Other identities. For all n >= 1: %F A260742 a(A003309(n+2)) = A000959(n+1). [Maps odd Ludic numbers to Lucky numbers.] %F A260742 a(n) = a(2n)/2. [The even bisection halved gives the sequence back.] %o A260742 (Scheme, with memoization macro definec) %o A260742 (definec (A260742 n) (if (<= n 1) n (A255551bi (A260738 n) (A260742 (A260739 n))))) ;; Code for A255551bi given in A255551. %Y A260742 Inverse: A260741. %Y A260742 Cf. A000959, A003309, A255551, A260738, A260739. %Y A260742 Similar permutations: A260436, A250245, A250246. %K A260742 nonn %O A260742 1,2 %A A260742 _Antti Karttunen_, Jul 30 2015