login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

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

LINKS

Table of n, a(n) for n=0..91.

Michael Gilleland, Some Self-Similar Integer Sequences

R. Stephan, Some divide-and-conquer sequences ...

R. Stephan, Table of generating functions

Index entries for sequences related to binary expansion of n

FORMULA

a(n) = A034472(A007814(n)).

a(2n) = 3a(n)-2; a(2n+1) = 2.

G.f.: 1/(1-x) + Sum_{k>=0} 3^k*x^2^k/(1 - x^2^(k+1)). - Ralf Stephan, Jun 13 2003

CROSSREFS

Sequence in context: A196759 A188813 A072866 * A260361 A055935 A086930

Adjacent sequences:  A061390 A061391 A061392 * A061394 A061395 A061396

KEYWORD

nonn

AUTHOR

Henry Bottomley, Apr 30 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 16:02 EST 2017. Contains 295905 sequences.