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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111185 Let f(n) denote the largest prime factor of n which is not a palindrome. Sequence gives numbers n such that the sum of the factorials of the digits of n is equal to f(n) 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

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

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}] (Propper)

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 (zevi_35711(AT)yahoo.com), 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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 28 21:04 EST 2014. Contains 250406 sequences.