login

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”).

A215089
a(n)=Sum{d(i)*6^i: i=0,1,...,m}, where Sum{d(i)*2^i: i=0,1,...,m} is the base 2 representation of n.
1
0, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 13, 10, 11, 12, 13, 14, 15, 4, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 13, 10, 11, 12, 13, 14, 15, 12, 13, 14, 15, 16, 17, 14, 15, 16, 17, 18, 19, 8, 9, 10, 11, 12, 13, 10
OFFSET
0,3
LINKS
FORMULA
a(n) = 2*a(n/6) if n = 0 mod 6; otherwise a(n) = a(n-1)+1.
MATHEMATICA
t = Table[FromDigits[RealDigits[n, 6], 2], {n, 0, 100}]
CROSSREFS
Cf. A033043.
Sequence in context: A173525 A070772 A094937 * A329243 A375636 A161768
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Aug 03 2012
STATUS
approved