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 A269357 #9 Mar 03 2016 22:48:51 %S A269357 1,2,3,4,5,6,7,8,23,10,11,12,13,14,15,16,9,46,17,20,31,22,25,24,21,26, %T A269357 27,28,19,30,29,32,49,18,71,92,37,34,39,40,41,62,43,44,107,50,47,48, %U A269357 119,42,51,52,35,54,89,56,101,38,53,60,61,58,63,64,115,98,67,36,173,142,55,184,33,74,75,68,131,78,77,80,167 %N A269357 Permutation of natural numbers: a(1) = 1, a(2n) = 2*a(n), a(2n+1) = A269380(A250469(2n+1)). %C A269357 This is a variant of A269355, from which it differs for the first time at n=18. %H A269357 Antti Karttunen, <a href="/A269357/b269357.txt">Table of n, a(n) for n = 1..16384</a> %H A269357 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A269357 a(1) = 1, after which, for even n, a(n) = 2*a(n/2) and for odd n, a(n) = A269355(n) = A269380(A250469(n)). %F A269357 Other identities. For all n >= 1: %F A269357 A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.] %o A269357 (Scheme, with memoization-macro definec) %o A269357 (definec (A269357 n) (cond ((<= n 1) n) ((even? n) (* 2 (A269357 (/ n 2)))) (else (A269380 (A250469 n))))) %Y A269357 Inverse: A269358. %Y A269357 Cf. A000035, A250469, A269380, A269355, A269172. %K A269357 nonn %O A269357 1,2 %A A269357 _Antti Karttunen_, Mar 03 2016