Talk:Frobenius numbers

title of this task

These are not Frobenius primes.   Indeed, some numbers of this series aren't prime.

According to OEIS,   they are known as   the Frobenius number of the numerical semi-group generated by prime(n) and prime(n+1)       (as noted in OEIS entry A037165 by Victoria A. Sapko).     They are also known as   Frobenius numbers.     -- Gerard Schildberger (talk) 22:57, 1 April 2021 (UTC)

task clarification

It appears that when the task's author stated:

      a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where prime(n) < 10,000 

it was meant to mean:

      a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where n < 10,000       

This is based on the output for the   Ring   example's output.     -- Gerard Schildberger (talk) 23:33, 1 April 2021 (UTC)