login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191895 Smallest multiple of n whose factorial digit sum equals n. 0
1, 2, 12, 112, 220, 222, 2212, 32, 12222, 1230, 1232, 2232, 22230, 1330, 30030, 3232, 20332, 1000332, 223231, 33300, 23331, 132330, 213233, 233232, 12233300, 104, 12222333, 224, 2204, 12240, 341, 3040, 202224, 10234, 23240, 2000304, 3034, 4332, 30342, 133240, 220334, 1032234 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..42.

EXAMPLE

a(7) = 2212 = 7*316 because 2! + 2! + 1! + 2! = 7.

MAPLE

with(numtheory): for n from 1 to 42 do: found:=false: for k from n by n while not found do q:=k: s:=0:

for m from 1 to length(k) do s:=s+irem(q, 10)! : q:=iquo(q, 10): od:

if s=n then found:=true: printf(`%d, `, k) fi od od:

MATHEMATICA

smn[n_]:=Module[{m=1}, While[Total[IntegerDigits[m*n]!]!=n, m++]; m*n]; Array[ smn, 50] (* Harvey P. Dale, Nov 17 2018 *)

PROG

(PARI) a(n)={ my(t, d=49); while((d-47)!<=n, d++); forstep(k=n, 9e99, n, t=Vecsmall(Str(k)); if( t[1]>d, k=(10^#t-1)\n*n, sum(j=1, #t, (t[j]-48)!)==n&return(k)))}  \\ - M. F. Hasler, Jun 20 2011

CROSSREFS

Sequence in context: A207778 A102659 A212659 * A047855 A199045 A009232

Adjacent sequences:  A191892 A191893 A191894 * A191896 A191897 A191898

KEYWORD

nonn,base

AUTHOR

Michel Lagneau, Jun 18 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 01:17 EDT 2019. Contains 323534 sequences. (Running on oeis4.)