If we ask which natural numbers n are not expressible as $n = ab + bc + ca$ ($0 < a < b < c$) then this is a well known open problem. Numbers not expressible in such form are called Euler's "numerus idoneus" and it is conjectured that they are finite.


If we omit the condition $a < b < c$ and assume $0 < a \leq b \leq c$ then it was proved (assuming Generalized Riemann Hypothesis) that there is only a finite number of such numbers $n$.


I am interested in the problem of expressing a prime number $p$ as $p = ab + ac + bc$ for $a \geq 1$ and $b,c \geq 2$.


Anybody knows if there is some known result related to expressing prime numbers in such form? This would yield (as a corollary) a very beautiful theorem related to spanning trees in graphs.



Prime numbers $p$ not of the form $ab + bc + ac$ $(0 < a < b < c )$ (and related questions)
Looking at the encyclopedia of integer sequnces, I've found that the set of numbers not expressible as ab + bc + ac 0 < a < b < c is finite.


<http://oeis.org/A000926>


Chowla showed that the list is finite and Weinberger showed that there is at most one further term.


