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 A279339 #8 Dec 12 2016 09:12:35 %S A279339 1,2,3,5,4,6,7,12,8,9,11,13,19,14,10,27,35,17,67,20,16,24,131,28,15, %T A279339 40,22,29,259,21,515,58,25,72,18,36,1027,136,46,43,2051,33,4099,51,23, %U A279339 264,8195,59,26,30,78,83,16387,45,31,60,142,520,32771,44,65539,1032,38,121,47,52,131075,147,270,37,262147,75,524291,2056,32,275,34,93 %N A279339 a(1) = 1; for n > 1, if n is even, a(n) = A055938(a(n/2)), otherwise a(n) = A005187(a(A064989(n))). %C A279339 A more recursed variant of A279337. %H A279339 Antti Karttunen, <a href="/A279339/b279339.txt">Table of n, a(n) for n = 1..141</a> %H A279339 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A279339 a(1) = 1; for n > 1, if n is even, a(n) = A055938(a(n/2)), otherwise a(n) = A005187(a(A064989(n))). %F A279339 As a composition of other permutations: %F A279339 a(n) = A279342(A243071(n)). %F A279339 a(n) = A279344(A156552(n)). %o A279339 (Scheme) %o A279339 (definec (A279339 n) (cond ((= 1 n) n) ((even? n) (A055938 (A279339 (/ n 2)))) (else (A005187 (A279339 (A064989 n)))))) %Y A279339 Inverse: A279338. %Y A279339 Cf. A005187, A055938, A064989. %Y A279339 Related or similar permutations: A156552, A243071, A279337, A279342, A279344. %K A279339 nonn %O A279339 1,2 %A A279339 _Antti Karttunen_, Dec 10 2016