|
%I #54 Oct 28 2022 09:50:30
%S 0,1,6,7,36,37,42,43,216,217,222,223,252,253,258,259,1296,1297,1302,
%T 1303,1332,1333,1338,1339,1512,1513,1518,1519,1548,1549,1554,1555,
%U 7776,7777,7782,7783,7812,7813,7818,7819,7992,7993,7998,7999,8028,8029,8034
%N Sums of distinct powers of 6.
%C Numbers without any base-6 digits greater than 1.
%H T. D. Noe, <a href="/A033043/b033043.txt">Table of n, a(n) for n = 0..1023</a>
%H Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, <a href="https://arxiv.org/abs/2210.10968">Identities and periodic oscillations of divide-and-conquer recurrences splitting at half</a>, arXiv:2210.10968 [cs.DS], 2022, p. 6.
%F a(n) = Sum_{i=0..m} d(i)*6^i, where Sum_{i=0..m} d(i)*2^i is the base-2 representation of n.
%F a(n) = A097252(n)/5.
%F a(2n) = 6*a(n), a(2n+1) = a(2n)+1.
%F a(n) = Sum_{k>=0} A030308(n,k)*6^k. - _Philippe Deléham_, Oct 20 2011
%F G.f.: (1/(1 - x))*Sum_{k>=0} 6^k*x^(2^k)/(1 + x^(2^k)). - _Ilya Gutkovskiy_, Jun 04 2017
%t t = Table[FromDigits[RealDigits[n, 2], 6], {n, 0, 100}] (* _Clark Kimberling_, Aug 02 2012 *)
%t FromDigits[#,6]&/@Tuples[{0,1},6] (* _Harvey P. Dale_, Mar 31 2016 *)
%o (PARI) A033043(n,b=6)=subst(Pol(binary(n)),'x,b) \\ _M. F. Hasler_, Feb 01 2016
%o (PARI) a(n)=fromdigits(binary(n), 6) \\ _Charles R Greathouse IV_, Jan 11 2017
%o (Julia)
%o function a(n)
%o m, r, b = n, 0, 1
%o while m > 0
%o m, q = divrem(m, 2)
%o r += b * q
%o b *= 6
%o end
%o r end; [a(n) for n in 0:46] |> println # _Peter Luschny_, Jan 03 2021
%Y Cf. A000695, A005836, A033043-A033052.
%Y Row 6 of array A104257.
%K nonn,base,easy
%O 0,3
%A _Clark Kimberling_
%E Extended by _Ray Chandler_, Aug 03 2004
|
