%I #17 Oct 01 2018 03:33:40
%S 1,2,4,2,10,2,4,2,28,2,4,2,10,2,4,2,82,2,4,2,10,2,4,2,28,2,4,2,10,2,4,
%T 2,244,2,4,2,10,2,4,2,28,2,4,2,10,2,4,2,82,2,4,2,10,2,4,2,28,2,4,2,10,
%U 2,4,2,730,2,4,2,10,2,4,2,28,2,4,2,10,2,4,2,82,2,4,2,10,2,4,2,28,2,4,2
%N Number of appearances of n in sequence defined by b(k) = b(floor(k/3)) + b(ceiling(k/3)) with b(0)=0 and b(1)=1, i.e., in A061392.
%C In the binary expansion of n, delete everything left of the rightmost 1 bit, then interpret as ternary and add 1. - _Ralf Stephan_, Aug 22 2013
%H Antti Karttunen, <a href="/A061393/b061393.txt">Table of n, a(n) for n = 0..65537</a>
%H Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>
%H R. Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences ...</a>
%H R. Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F a(n) = A034472(A007814(n)) for n > 0.
%F a(2n) = 3a(n)-2; a(2n+1) = 2.
%F G.f.: 1/(1-x) + Sum_{k>=0} 3^k*x^2^k/(1 - x^2^(k+1)). - _Ralf Stephan_, Jun 13 2003
%o (PARI) A061393(n) = if(!n,1,(1+3^valuation(n,2))); \\ _Antti Karttunen_, Sep 30 2018
%Y Cf. A061392.
%K nonn
%O 0,2
%A _Henry Bottomley_, Apr 30 2001