login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A198044 a(n) is the smallest number k such that d(1)*1! + d(2)*2! + ... + d(p)*p! = n, where d(1),...,d(p) are the decimal digits of k, or 0 if no such number exists. 4
1, 2, 3, 4, 5, 6, 7, 8, 9, 24, 15, 25, 16, 26, 17, 27, 18, 28, 19, 29, 39, 49, 59, 69, 79, 89, 99, 214, 124, 224, 105, 205, 115, 215, 125, 225, 106, 206, 116, 216, 126, 226, 107, 207, 117, 217, 127, 227, 108, 208, 118, 218, 128, 228, 109, 209, 119, 219, 129 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
If 9*A007489(d) < n < (d+1)! then a(n)=0. The least d for which 9*A007489(d)+1<(d+1)! is 10, so a(n)=0 for 36341217 < n < 39916800. - Robert Israel, Aug 16 2020
LINKS
EXAMPLE
a(59) = 129 because 1*1! + 2*2! + 9*3! = 1+4+54 = 59.
MAPLE
for n from 1 to 70 do :i:=0:for nn from 1 to 1000 while(i=0) do:l:=length(nn):n0:=nn:s:=0:for m from l by -1 to 1 do:q:=n0:u:=irem(q, 10):v:=iquo(q, 10):n0:=v :s:=s+u*m!:od: if s=n then i:=1:printf(`%d, `, nn):else fi:od:od:
MATHEMATICA
Table[k = 1; While[d = IntegerDigits[k]; s = Sum[d[[i]] i!, {i, Length[d]}]; s != n, k++]; k, {n, 100}] (* T. D. Noe, Oct 20 2011 *)
CROSSREFS
Cf. A007489.
Sequence in context: A307636 A048386 A302503 * A133134 A133505 A068407
KEYWORD
nonn,base,look
AUTHOR
Michel Lagneau, Oct 20 2011
EXTENSIONS
Definition edited by Robert Israel, Aug 16 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 08:19 EDT 2024. Contains 371905 sequences. (Running on oeis4.)