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!)
 A111185 Let f(k) denote the largest prime factor of k which is not a palindrome. Sequence gives numbers k such that the sum of the factorials of the digits of k is equal to f(k) reversed. 1
 143, 541, 2105, 2444, 3431, 4144, 4233, 4301, 4440, 10234, 12243, 12341, 20313, 22320, 30422, 34030, 34144, 35140, 46003, 52100, 53013, 102613, 106312, 112413, 113162, 120032, 134046, 200340, 202124, 203112, 210304, 211203, 211232, 212004 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE 2105 = 5*'421' and 2! + 1! + 0! + 5! = 124. MATHEMATICA r[n_] := FromDigits[Reverse[IntegerDigits[n]]]; np[n_] := (n != r[n]); f[n_] := Plus @@ Map[ #!&, IntegerDigits[n]]; Do[l = Select[First /@ FactorInteger[n], np]; If[Length[l] > 0, k = r[Max[l]]; If[k == f[n], Print[n]]], {n, 1, 10^6}] (* Ryan Propper, Oct 19 2005 *) CROSSREFS See A074301 for another version. Sequence in context: A213337 A156963 A126703 * A074301 A156635 A035304 Adjacent sequences:  A111182 A111183 A111184 * A111186 A111187 A111188 KEYWORD base,nonn AUTHOR Jason Earls, Sep 21 2002 EXTENSIONS More terms from Ryan Propper, Oct 19 2005 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 2 23:47 EDT 2020. Contains 333194 sequences. (Running on oeis4.)