Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 May 04 2015 02:15:25
%S 1,3,4,7,10,10,11,15,18,18,22,23,25,25,26,31,34,34,38,39,41,41,46,47,
%T 49,50,54,54,56,56,57,63,66,66,70,71,73,73,78,79,81,82,86,86,88,88,94,
%U 95,97,98,102,102,104,105,110,110,113,116,117,117,119,119,120,127,130,130,134,135,137,137,142,143,145,146
%N Row 2 of A257264: a(n) = A011371(A055938(n)).
%C The sequence gives the parent node of each leaf-vertex (A055938) in binary beanstalk.
%H Antti Karttunen, <a href="/A257507/b257507.txt">Table of n, a(n) for n = 1..16384</a>
%H Paul Tek, <a href="/A179016/a179016.png">Illustration of how natural numbers in range 0 .. 133 are organized as a binary tree in the binary beanstalk</a>
%F a(n) = A011371(A055938(n)).
%e Terms of A055938 are the leaf-nodes in Paul Tek's illustration. This sequence gives the corresponding parent-node (in that illustration a node immediately below where the arrow points), for each term of A055938[1..]: 2, 5, 6, 9, 12, 13, 14, ...
%e As A055938(4) = 9, and 9's parent node is 7 (because A011371(9) = 7), a(4) = 7.
%e As A055938(5) = 12, and 12's parent node is 10, a(5) = 10.
%e As A055938(6) = 13, and 13's parent node is 10, a(6) = 10.
%o (Scheme) (define (A257507 n) (A011371 (A055938 n)))
%Y Row 2 of A257264.
%Y Cf. A011371, A055938.
%Y Cf. A257508 (same sequence with duplicates removed), A257512 (the terms which occur twice).
%K nonn
%O 1,2
%A _Antti Karttunen_, May 03 2015