%I #12 Oct 27 2023 22:05:37
%S 1,2,4,8,16,212,424,848,16816,21216212,424212424,848424848,
%T 1681684816816,212162121681621216212,42421242421216212424212424,
%U 848424848424212424848424848,16816848168168484248481681684816816
%N a(1) = 1, a(n) = number obtained by replacing each digit of a(n-1) with its double.
%C It might have been more natural to start with index / offset 0. - _M. F. Hasler_, Jun 24 2016
%H Alois P. Heinz, <a href="/A061581/b061581.txt">Table of n, a(n) for n = 1..29</a>
%e The term after 16 is 2.12, i.e., 212.
%p a:= proc(n) option remember; `if`(n=1, 1, (l->
%p parse(cat(seq(2*l[-i], i=1..nops(l)))))(
%p convert(a(n-1), base, 10)))
%p end:
%p seq(a(n), n=1..20); # _Alois P. Heinz_, Jun 24 2016
%t NestList[FromDigits[Flatten[IntegerDigits[2*IntegerDigits[#]]]] &,1,16] (* _Jayanta Basu_, May 20 2013 *)
%o (PARI) A061581(n=2,a=1,m=2)={while(n--,a=eval(concat(apply(t->Str(t),digits(a)*m))));a} \\ If only the 2nd argument is given, then the operation is applied once to that argument. - _M. F. Hasler_, Jun 24 2016
%Y Cf. A061582 - A061587.
%K nonn,base,easy
%O 1,2
%A _Amarnath Murthy_, May 13 2001
%E More terms from Larry Reeves (larryr(AT)acm.org) and _Asher Auel_, May 15 2001
|