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 A249813 #17 Jan 18 2015 19:04:05 %S A249813 1,2,3,4,5,8,7,6,9,16,15,32,13,10,11,64,17,128,31,14,29,256,63,12,25, %T A249813 18,19,512,21,1024,127,30,33,20,255,2048,61,26,27,4096,57,8192,511,22, %U A249813 125,16384,23,24,49,34,35,32768,37,28,1023,62,41,65536,2047,131072,253,58,59,36,65,262144,39,126,509,524288,4095,1048576,121,50,51,40,53 %N A249813 Permutation of natural numbers: a(1) = 1, a(n) = A000079(A055396(n+1)-1) * ((2 * a(A078898(n+1))) - 1). %C A249813 This sequence is a "recursed variant" of A249812. %C A249813 See also the comments at the inverse permutation A249814. %H A249813 Antti Karttunen, <a href="/A249813/b249813.txt">Table of n, a(n) for n = 1..1024</a> %H A249813 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A249813 a(1) = 1, a(n) = A000079(A055396(n+1)-1) * ((2 * a(A078898(n+1))) - 1). %F A249813 As a composition of other permutations: %F A249813 a(n) = A246683(A250243(n)). %F A249813 Other identities. For all n >= 1, the following holds: %F A249813 a(n) = (1+a((2*n)-1))/2. [The odd bisection from a(1) onward with one added and then halved gives the sequence back.] %F A249813 a(A006093(n)) = A000079(n-1). %o A249813 (Scheme, with memoizing macro definec from _Antti Karttunen_'s IntSeq-library) %o A249813 (definec (A249813 n) (cond ((<= n 1) n) (else (* (A000079 (- (A055396 (+ 1 n)) 1)) (+ -1 (* 2 (A249813 (A078898 (+ 1 n))))))))) %Y A249813 Inverse: A249814. %Y A249813 Similar or related permutations: A246683, A249812, A250243. %Y A249813 Cf. A000079, A006093, A055396, A078898. %Y A249813 Differs from A246683 for the first time at n=20, where a(20) = 14, while A246683(20) = 18. %K A249813 nonn %O A249813 1,2 %A A249813 _Antti Karttunen_, Nov 06 2014