Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Mar 23 2024 10:42:30
%S 1,2,3,9,41,99,1863,4019,8925
%N Numbers k such that R(k)^3 + R(k)^2 + 1 is prime, where R(k) = (10^k-1)/9.
%t okQ[n_]:=Module[{x=FromDigits[PadRight[{},n,1]]},PrimeQ[x^3+x^2+1]]; Select[Range[5000],okQ] (* _Harvey P. Dale_, Nov 04 2011 *)
%K nonn,hard,more
%O 1,2
%A _Jason Earls_, Oct 06 2010
%E a(9) from _Michael S. Branicky_, Mar 22 2024