|
%I #7 Apr 14 2014 11:21:23
%S 4,10,11,12,16,18,24,27,28,32,34,36,39,44,45,49,51,52,57,58,60,61,62,
%T 63,64,69,75,76,77,78,80,83,84,87,88,90,91,94,96,97,100,103,106,107,
%U 108,113,114,115,118,119,124,129,130,132,135,138,139,142,143,144,149
%N Numbers n such that DigitSum(5^n) > DigitSum(5^(n+1)).
%H K. D. Bajpai, <a href="/A240580/b240580.txt">Table of n, a(n) for n = 1..1000</a>
%e The digitsum(5^4) = 13 > 11 = digitsum(5^(4+1)). Hence, 4 appears in the sequence.
%e The digitsum(5^11) = 38 > 28 = digitsum(5^(11+1)). Hence, 11 appears in the sequence.
%p a := proc(n) local a,b,d,e; a:=5^n; b:=add( i,i = convert((a), base, 10))(a); d:=5^(n+1); e:=add( i,i = convert((d), base, 10))(d); if b > e then RETURN (n); fi; end: seq(a(n), n=1..300);
%t k=Table[Total[IntegerDigits[5^n,10]],{n,1,300}];Flatten[Position[Greater@@@Partition[k,2,1],True]]
%Y Cf. A186775 ( numbers n: digitsum(2^(n)) > digitsum(2^(n+1)) ),
%Y A239935 ( numbers n: digitsum(3^n) > digitSum(3^(n+1)) ).
%K nonn,base
%O 1,1
%A _K. D. Bajpai_, Apr 08 2014
|
