|
| |
|
|
A074256
|
|
Sum of factorials of digits of n equals sum of the primes from the smallest prime factor of n to the largest prime factor of n.
|
|
0
| |
|
|
2, 242, 1323, 3200, 13050, 30000, 42432, 132300, 426205, 442244, 620425, 665353, 1261645, 1306254, 1453032, 1461363, 1523340, 1523466, 2025012, 2105334, 2134350, 2205102, 2613504, 2713421, 3005264, 3312400, 3314520, 3432000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
EXAMPLE
| 242 = 2*11^2 and 2+3+5+7+11 = 28 and 2!+4!+2! = 28.
|
|
|
MATHEMATICA
| okQ[n_]:=Module[{ifn=Transpose[FactorInteger[n]][[1]]}, Total[Prime[Range[PrimePi[Min[ifn]], PrimePi[Max[ifn]]]]]==Total[IntegerDigits[n]!]]; Select[Range[2, 3500000], okQ] (* From Harvey P. Dale, Apr 21 2011 *)
|
|
|
CROSSREFS
| Cf. A074036.
Sequence in context: A024348 A006523 A055968 * A146312 A109930 A013509
Adjacent sequences: A074253 A074254 A074255 * A074257 A074258 A074259
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Sep 20 2002
|
|
|
EXTENSIONS
| More terms from Michel ten Voorde (seqfan(AT)tenvoorde.org) Jun 20 2003
More terms from Sam Alexander (amnalexander(AT)yahoo.com), Feb 28 2005
|
| |
|
|
