cp's OEIS Frontend

A061393 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.

%I A061393 #17 Oct 01 2018 03:33:40
%S A061393 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 A061393 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 A061393 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 A061393 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 A061393 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 A061393 Antti Karttunen, <a href="/A061393/b061393.txt">Table of n, a(n) for n = 0..65537</a>
%H A061393 Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>
%H A061393 R. Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences ...</a>
%H A061393 R. Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>
%H A061393 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A061393 a(n) = A034472(A007814(n)) for n > 0.
%F A061393 a(2n) = 3a(n)-2; a(2n+1) = 2.
%F A061393 G.f.: 1/(1-x) + Sum_{k>=0} 3^k*x^2^k/(1 - x^2^(k+1)). - _Ralf Stephan_, Jun 13 2003
%o A061393 (PARI) A061393(n) = if(!n,1,(1+3^valuation(n,2))); \\ _Antti Karttunen_, Sep 30 2018
%Y A061393 Cf. A061392.
%K A061393 nonn
%O A061393 0,2
%A A061393 _Henry Bottomley_, Apr 30 2001