|
%I #66 Jul 13 2023 19:51:05
%S 1,2,4,8,16,7,14,5,10,20,40,80,160,320,640,1280,11,22,44,88,176,352,
%T 704,1408,13,26,52,104,208,416,832,1664,17,34,68,136,272,544,1088,
%U 2176,4352,8704,19,38,76,152,304,608,1216,2432,4864,9728,19456,25,50,100,200
%N a(1) = 1; a(n+1) = 2*a(n) if the digit sum of a(n) is already in the sequence, otherwise a(n+1) = digitsum(a(n)).
%C There are no multiples of 3 in this sequence.
%C Will all other positive integers appear in this sequence?
%H Rémy Sigrist, <a href="/A348433/b348433.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A348433/a348433.gp.txt">PARI program for A348433</a>
%e The sum of the digits of a(4) = 8 is 8, which is already in the sequence, so a(5) = 2*8 = 16.
%e The sum of the digits of a(5) = 16 is 7, which is not yet in the sequence, so a(6) = 7.
%e From _Omar E. Pol_, Oct 19 2021: (Start)
%e Written as an irregular triangle the sequence begins (see A348408):
%e 1, 2, 4, 8, 16;
%e 7, 14;
%e 5, 10, 20, 40, 80, 160, 320, 640, 1280;
%e 11, 22, 44, 88, 176, 352, 704, 1408;
%e 13, 26, 52, 104, 208, 416, 832, 1664;
%e 17, 34, 68, 136, 272, 544, 1088, 2176, 4352, 8704;
%e 19, 38, 76, 152, 304, 608, 1216, 2432, 4864, 9728, 19456;
%e ... (End)
%t seq[len_] := Module[{s = {1}, k, d}, While[Length[s] < len, k = s[[-1]]; If[MemberQ[s, (d = Plus @@ IntegerDigits[k])], AppendTo[s, 2*k], AppendTo[s, d]]]; s]; seq[50] (* _Amiram Eldar_, Oct 19 2021 *)
%o (PARI) lista(nn) = my(s, v=List([1])); for(n=1, nn, if(setsearch(vecsort(v), s=sumdigits(v[n])), listput(v, 2*v[n]), listput(v, s))); v \\ _Jinyuan Wang_, Oct 21 2021
%o (PARI) See Links section.
%Y Cf. A001651, A007953, A008585, A331440 (similar), A348400, A348408, A348483.
%K nonn,base
%O 1,2
%A _Rodolfo Kurchan_, Oct 18 2021
%E Definition and examples clarified by _N. J. A. Sloane_, Oct 24 2021
|
