|
Search: id:A067791
|
|
|
| A067791 |
|
Smallest multidigit prime such that the sum of the squares of its digits is equal to n times the product of its digits, or 0 if no such prime exists. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Sum(xi^2)=n*Prod(xi) where xi is the i-th digit of a prime in base 10. The zero has been entered for those n values such that no solution has been found up to 10^7.
|
|
CROSSREFS
|
Sequence in context: A110375 A112441 A104017 this_sequence A067779 A082440 A083975
Adjacent sequences: A067788 A067789 A067790 this_sequence A067792 A067793 A067794
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Feb 06 2002
|
|
|
Search completed in 0.002 seconds
|
