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 A253888 #13 Jan 25 2015 23:21:53 %S A253888 1,3,4,6,7,13,18,15,9,63,39,28,43,12,10,27,31,16,19,138,88,123,45,25, %T A253888 78,48,30,81,24,73,55,105,22,36,108,72,438,111,21,37,303,33,148,42,93, %U A253888 87,103,213,54,91,58,298,171,34,363,165,172,198,102,49,69,163,76,46,115,228,333,288,61,135,319,90,130,75,52 %N A253888 a(0) = 1; for n >= 1: a(n) = A048673(1+(2*A064216(n))). %C A253888 When A048673 is represented as a binary tree, then the node k which contains value n = A048673(k) has as its right child a(n) = A048673(2k+1). %H A253888 Antti Karttunen, <a href="/A253888/b253888.txt">Table of n, a(n) for n = 0..8192</a> %F A253888 a(0) = 1; for n >= 1: a(n) = A048673(1+(2*A064216(n))). %F A253888 Also, for n >= 1: a(n) = A254049(1+A064216(n)). %o A253888 (Scheme, two versions) %o A253888 (define (A253888 n) (if (zero? n) 1 (A048673 (+ 1 (* 2 (A064216 n)))))) %o A253888 (define (A253888 n) (if (zero? n) 1 (A254049 (+ 1 (A064216 n))))) %Y A253888 Same sequence sorted into ascending order: A032766. %Y A253888 Also a permutation of A254049. %Y A253888 Cf. A048673, A064216, A253889, A253890, A254051, A254053. %K A253888 nonn %O A253888 0,2 %A A253888 _Antti Karttunen_, Jan 22 2015