Search: id:A099358
Results 1-1 of 1 results found.

%I A099358
%S A099358 1,8,17,30,43,61,68,87,105,106,122,140,162,184,202,227,246,273,283,290,
%T A099358 317,339,370,397,422,459,477,505,530,539,561,592,619,644,663,699,727,
%U A099358 752,770,783,814,841,866,903,921,958,1001,1028,1059,1072,1099,1124,1161
%N A099358 a(n) = sum of digits of k^4 as k runs from 1 to n.
%F A099358 a(n) = a(n-1) + sum of decimal digits of n^4.
%F A099358 a(n)=sum(k=1, n, sum(m=0, floor(log(k^4)), floor(10((k^4)/(10^(((floor(log(k^4))+1))-m)) 
               - floor ((k^4)/(10^(((floor(log(k^4))+1))-m)))))))
%F A099358 General formula: a(n)_p = sum(k=1, n, sum(m=0, floor(log(k^p)), floor(10((k^p)/
               (10^(((floor(log(k^p))+1))-m)) - floor ((k^p)/(10^(((floor(log(k^p))+1))-m))))))). 
               Here a(n)_p is a sum of digits of k^p from k=1 to n
%e A099358 a(600)=sum(k=1,600,sum(m=0,floor(log(k^4)),floor(10*((k^4)/(10^(((floor(log(k^4))+1))-m)) 
               - floor ((k^4)/(10^(((floor(log(k^4))+1))-m)))))))=23812 => a(600)=23812 
               = a(600)_4 because p=4
%t A099358 f[n_] := Block[{s = 0, k = 1}, While[k <= n, s = s + Plus @@ IntegerDigits[k^4]; 
               k++ ]; s]; Table[ f[n], {n, 50}] (from Robert G. Wilson v Nov 18 
               2004)
%Y A099358 Cf. k^1 in A037123, k^2 in A071317 & k^3 in A071121.
%Y A099358 Sequence in context: A044441 A056121 A028884 this_sequence A077222 A077221 
               A106648
%Y A099358 Adjacent sequences: A099355 A099356 A099357 this_sequence A099359 A099360 
               A099361
%K A099358 nonn,easy,base
%O A099358 1,2
%A A099358 Aktir Yalcin (aktaryalcin(AT)msn.com), Nov 16 2004
%E A099358 Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 18 
               2004

Search completed in 0.001 seconds