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!)
 A135204 Numbers n for which Sum_digits(n!) is a multiple of Sum_digits(n). 3
 1, 2, 3, 9, 10, 11, 12, 14, 16, 18, 20, 21, 22, 27, 28, 30, 33, 35, 36, 44, 45, 51, 54, 60, 61, 63, 72, 75, 81, 87, 90, 99, 100, 102, 105, 108, 111, 114, 117, 120, 126, 130, 135, 143, 144, 153, 158, 162, 165, 171, 180, 182, 185, 189, 190, 192, 200, 201, 202, 204, 206 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS I expect a(n) to be around kn log n for some constant k. - Charles R Greathouse IV, Apr 24 2013 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 EXAMPLE 11 -> 11*10*9*8*7*6*5*4*3*2*1=39916800 -> (3+9+9+1+6+8+0+0)/(1+1)=18. MAPLE P:=proc(n) local i, k, w, x; for i from 1 by 1 to n do w:=0; k:=i; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; x:=0; k:=i!; while k>0 do x:=x+k-(trunc(k/10)*10); k:=trunc(k/10); od; if trunc(x/w)=x/w then print(i); fi; od; end: P(1000); MATHEMATICA Select[Range[100], Divisible[Total[IntegerDigits[#!, 10]], Total[IntegerDigits[#, 10]]] &] (* G. C. Greubel, Sep 30 2016 *) PROG (PARI) is(n)=sumdigits(n!)%sumdigits(n)==0 \\ Charles R Greathouse IV, Apr 24 2013 CROSSREFS Cf. A004152, A120390, A108825, A129980, A131954, A131955, A135205, A135206. Sequence in context: A163905 A235499 A242590 * A037463 A309348 A270886 Adjacent sequences:  A135201 A135202 A135203 * A135205 A135206 A135207 KEYWORD nonn,base AUTHOR Paolo P. Lava and Giorgio Balzarotti, Nov 30 2007 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 April 17 02:26 EDT 2021. Contains 343059 sequences. (Running on oeis4.)