Search: id:A061393
Results 1-1 of 1 results found.

%I A061393
%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.
%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.ps">Table of generating functions</a>
%F A061393 a(n) = A034472(A007814(n)). 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 (ralf(AT)ark.in-berlin.de), 
               Jun 13 2003
%Y A061393 Sequence in context: A008303 A058942 A072866 this_sequence A055935 A086930 
               A099585
%Y A061393 Adjacent sequences: A061390 A061391 A061392 this_sequence A061394 A061395 
               A061396
%K A061393 nonn
%O A061393 0,2
%A A061393 Henry Bottomley (se16(AT)btinternet.com), Apr 30 2001

Search completed in 0.001 seconds