

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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


LINKS

Clark Kimberling, Table of n, a(n) for n = 0..1000


FORMULA

a(n) = 2*a(n/6) if n = 0 mod 6; otherwise a(n) = a(n1)+1.


MATHEMATICA

t = Table[FromDigits[RealDigits[n, 6], 2], {n, 0, 100}]


CROSSREFS

Cf. A033043.
Sequence in context: A173525 A070772 A094937 * A161768 A213925 A141810
Adjacent sequences: A215086 A215087 A215088 * A215090 A215091 A215092


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Aug 03 2012


STATUS

approved



