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!)
 A280342 Sum of digits of A003418(n). 1

%I

%S 1,1,2,6,3,6,6,6,12,9,9,18,18,18,18,18,18,18,18,36,36,36,36,45,45,36,

%T 36,27,27,54,54,54,54,54,54,54,54,54,54,54,54,72,72,81,81,81,81,72,72,

%U 90,90,90,90,99,99,99,99,99,99,99,99,90,90,90,99,99,99,117,117,117

%N Sum of digits of A003418(n).

%C For n>2, a(n) mod 3 = 0.

%H Indranil Ghosh, <a href="/A280342/b280342.txt">Table of n, a(n) for n = 0..10000</a>

%H Indranil Ghosh, <a href="/A280342/a280342.txt">Python Program to generate the sequence.</a>

%F a(n) = A007953(A003418(n)). - _Michel Marcus_, Jan 01 2017

%e For n=10, A003418(10) = 2520. So, the sum of digits of 2520 is 2+5+2+0 = 9. a(10)=9.

%o (PARI) a(n) = sumdigits(lcm(vector(n, i, i))); \\ _Michel Marcus_, Jan 01 2017

%Y Cf. A003418, A007953.

%K nonn,base

%O 0,3

%A _Indranil Ghosh_, Jan 01 2017

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 August 5 20:48 EDT 2021. Contains 346488 sequences. (Running on oeis4.)