The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110805 Sum of digits of n times number of digits of n. 5

%I

%S 1,2,3,4,5,6,7,8,9,2,4,6,8,10,12,14,16,18,20,4,6,8,10,12,14,16,18,20,

%T 22,6,8,10,12,14,16,18,20,22,24,8,10,12,14,16,18,20,22,24,26,10,12,14,

%U 16,18,20,22,24,26,28,12,14,16,18,20,22,24,26,28,30

%N Sum of digits of n times number of digits of n.

%H Michael De Vlieger, <a href="/A110805/b110805.txt">Table of n, a(n) for n = 1..10000</a>

%e a(19) = 2 * (1 + 9) = 20.

%e a(1235) = 4 * (1 + 2 + 3 + 5) = 44.

%t Table[IntegerLength[n] * Total[IntegerDigits[n]], {n,50}] (* _Harvey P. Dale_, Jul 31 2012 *)

%o (PARI) a(n) = sumdigits(n) * #digits(n); \\ _Michel Marcus_, Feb 24 2017

%Y Cf. A007953, A055642.

%K base,easy,nonn

%O 1,2

%A _Amarnath Murthy_, Aug 14 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 27 06:30 EDT 2021. Contains 346304 sequences. (Running on oeis4.)