STATUS
reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
(PARI) a(n)=for(k=0, oo, if(omega(k^3+1) == n, return(k))) \\ Andrew Howroyd, Sep 12 2023
proposed
editing
editing
proposed
Name clarified and incorrect programs program removed by Pontus von Brömssen, Sep 12 2023
a(n) = k is the smallest number such that k^3 + 1 has exactly n distinct prime factors.
Join[{0}, Table[k = 1; While[Length[FactorInteger[k^3 + 1]] < n, k++]; k, {n, 10}]] (* T. D. Noe, Nov 12 2012 *)
Name clarified and incorrect programs removed by Pontus von Brömssen, Sep 12 2023
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed