|
%I #15 Jan 07 2024 00:14:15
%S 11353,11,211,1111116211,11411,511111,1111111111111111111111111111213,
%T 11111117,111111181,1111111111111111111711,2111111111111111111,
%U 111111111111111121111,1111111111111111111111141111111111111,1111111111111111211111111
%N 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.
%C Sum(xi^2) = n*Product(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.
%C No more terms up to 4.4*10^11.
%C a(n) > (10^52-1)/9 for n = 18, 20, and 22. - _Donovan Johnson_
%H Sean A. Irvine, <a href="/A067791/b067791.txt">Table of n, a(n) for n = 1..100</a>
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a067/A067791.java">Java program</a> (github)
%K nonn,base
%O 1,1
%A _Felice Russo_, Feb 06 2002
%E a(8) and a(9) corrected by _Charles R Greathouse IV_, Nov 19 2010
%E a(4), a(7), a(10)-a(17), a(19), a(21) and a(23) from _Donovan Johnson_, Nov 20 2010
| 