|
%I #39 Oct 28 2022 09:51:57
%S 0,1,20,21,400,401,420,421,8000,8001,8020,8021,8400,8401,8420,8421,
%T 160000,160001,160020,160021,160400,160401,160420,160421,168000,
%U 168001,168020,168021,168400,168401,168420,168421,3200000,3200001,3200020
%N Sum of distinct powers of 20; i.e., numbers with digits in {0,1} base 20; i.e., write n in base 2 and read as if written in base 20.
%H Harry J. Smith, <a href="/A063012/b063012.txt">Table of n, a(n) for n = 0..1000</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. 45.
%F a(n) = a(n-2^floor(log_2(n))) + 20^floor(log_2(n)). a(2n) = 20*a(n); a(2n+1) = a(2n)+1 = 20*a(n)+1.
%F a(n) = Sum_{k>=0} A030308(n,k)*A009964(k). - _Philippe Deléham_, Oct 15 2011
%F G.f.: (1/(1 - x))*Sum_{k>=0} 20^k*x^(2^k)/(1 + x^(2^k)). - _Ilya Gutkovskiy_, Jun 04 2017
%e a(5) = 401 since 5 written in base 2 is 101 so a(5) = 1*20^2 + 0*20^1 + 1*20^0 = 400 + 0 + 1 = 401.
%t Table[FromDigits[IntegerDigits[n,2],20],{n,0,40}] (* _Harvey P. Dale_, Jul 21 2014 *)
%o (PARI) baseE(x, b)= { local(d, e, f); e=0; f=1; while (x>0, d=x-b*(x\b); x\=b; e+=d*f; f*=10); return(e) } baseI(x, b)= { local(d, e, f); e=0; f=1; while (x>0, d=x-10*(x\10); x\=10; e+=d*f; f*=b); return(e) } { for (n=0, 1000, write("b063012.txt", n, " ", baseI(baseE(n, 2), 20)) ) } \\ _Harry J. Smith_, Aug 15 2009
%Y A001477, A005836, A000695, A033042, A033043, A033044, A033045, A033046, A007088, A033047, A033048, A033049, A033050, A033051, A033052 are similar sequences for 2-16.
%Y A063013 is similar in a different way.
%K easy,nonn,base
%O 0,3
%A _Henry Bottomley_, Jul 04 2001
%E Edited by _Charles R Greathouse IV_, Aug 02 2010
|
