# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a057147
Showing 1-1 of 1

%I A057147 #32 Mar 28 2018 03:58:29
%S A057147 0,1,4,9,16,25,36,49,64,81,10,22,36,52,70,90,112,136,162,190,40,63,88,
%T A057147 115,144,175,208,243,280,319,90,124,160,198,238,280,324,370,418,468,
%U A057147 160,205,252,301,352,405,460,517,576,637,250,306,364,424,486,550,616
%N A057147 a(n) = n times sum of digits of n.
%C A057147 A056992(n) = A010888(a(n)). - _Reinhard Zumkeller_, Mar 19 2014
%H A057147 Reinhard Zumkeller, <a href="/A057147/b057147.txt">Table of n, a(n) for n = 0..10000</a>
%H A057147 F. B. Diniz, <a href="http://arxiv.org/abs/1607.06082">About a new family of sequences</a>, arXiv:1607.06082 [math.GM], 2016.
%F A057147 a(n) = n*A007953(n). - _Michel Marcus_, Aug 10 2014
%F A057147 G.f.: x * (d/dx) (1/(1 - x))*Sum_{k>=1} (x^k - x^(10^k+k) - 9*x^(10^k))/(1 - x^(10^k)). - _Ilya Gutkovskiy_, Mar 27 2018
%p A057147 for n from 0 to 150 do printf(`%d,`,n*add(convert(n, base, 10)[i], i=1..nops(convert(n,base, 10)))) od:
%t A057147 Table[n*Total[IntegerDigits[n]], {n, 0, 100}]
%o A057147 (Haskell)
%o A057147 a057147 n = a007953 n * n  -- _Reinhard Zumkeller_, Mar 19 2014
%o A057147 (PARI) a(n) = n*sumdigits(n) \\ _Franklin T. Adams-Watters_, Aug 03 2014
%o A057147 (Python)
%o A057147 [n*sum([int(d) for d in str(n)]) for n in range(10**5)] # _Chai Wah Wu_, Aug 05 2014
%Y A057147 Cf. A007953, A003634, A005349, A052489, A052490, A003635, A245788.
%Y A057147 Iterations: A047892 (start=2), A047912 (start=3), A047897 (start=5), A047898 (start=6), A047899 (start=7), A047900 (start=8), A047901 (start=9), A047902 (start=11).
%K A057147 nonn,base,easy,look
%O A057147 0,3
%A A057147 _N. J. A. Sloane_, Sep 13 2000
%E A057147 More terms from _James A. Sellers_ and Larry Reeves (larryr(AT)acm.org), Sep 13 2000

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE