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
 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, 36, 27, 27, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 72, 72, 81, 81, 81, 81, 72, 72, 90, 90, 90, 90, 99, 99, 99, 99, 99, 99, 99, 99, 90, 90, 90, 99, 99, 99, 117, 117, 117 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS For n>2, a(n) mod 3 = 0. LINKS Indranil Ghosh, Table of n, a(n) for n = 0..10000 Indranil Ghosh, Python Program to generate the sequence. FORMULA a(n) = A007953(A003418(n)). - Michel Marcus, Jan 01 2017 EXAMPLE For n=10, A003418(10) = 2520. So, the sum of digits of 2520 is 2+5+2+0 = 9. a(10)=9. PROG (PARI) a(n) = sumdigits(lcm(vector(n, i, i))); \\ Michel Marcus, Jan 01 2017 CROSSREFS Cf. A003418, A007953. Sequence in context: A083481 A177209 A274439 * A275476 A185380 A136695 Adjacent sequences:  A280339 A280340 A280341 * A280343 A280344 A280345 KEYWORD nonn,base AUTHOR Indranil Ghosh, Jan 01 2017 STATUS approved

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 June 14 00:02 EDT 2021. Contains 345016 sequences. (Running on oeis4.)