|
Search: id:A111185
|
|
|
| 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. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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.
Adjacent sequences: A111182 A111183 A111184 this_sequence A111186 A111187 A111188
Sequence in context: A073954 A003902 A126703 this_sequence A074301 A035304 A135946
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Sep 21 2002
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Oct 19 2005
|
|
|
Search completed in 0.002 seconds
|
