|
Search: id:A165451
|
|
|
| A165451 |
|
Sum of factorial of digits is prime. |
|
+0
1
|
|
| 2, 10, 11, 12, 13, 20, 21, 30, 31, 100, 101, 110, 111, 122, 133, 134, 135, 136, 143, 153, 155, 163, 178, 187, 202, 212, 220, 221, 303, 304, 305, 306, 313, 314, 315, 316, 330, 331, 340, 341, 350, 351, 360, 361, 403, 413, 430, 431, 503, 505, 513, 515, 530, 531
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
1!+3!+5! = 127 and 127 is prime, so 135 appears in the sequence
|
|
PROGRAM
|
(PARI) digfac(n)=local(s=0); while(n, s=s+((n%10)!); n=n\10); return(s) for(n=1, 1000, if(isprime(digfac(n)), print1(n, ", ")))
|
|
CROSSREFS
|
Cf. A061602
Sequence in context: A033466 A089601 A043072 this_sequence A121717 A106518 A007089
Adjacent sequences: A165448 A165449 A165450 this_sequence A165452 A165453 A165454
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Remy Sigrist (remysigrist(AT)free.fr), Sep 20 2009
|
|
|
Search completed in 0.002 seconds
|
