OFFSET
1,1
COMMENTS
The primes p, q, r are listed as a(3n-2), a(3n-1), a(3n) for n = 1, 2, 3, ...
Caldwell & Cheng show that there are only 3 Honaker trios below 2*10^17 and that these are the only Honaker trios if the Cramér-Granville conjecture is satisfied with a constant M < 199262; they also give other sufficient conditions for the number of Honaker trios to be finite.
Strictly speaking, the keywords "fini,full" are thus only conjectured, but given that the Cramér-Granville conjecture is believed to hold with M = 2*exp(-gamma) ~ 1.123, it seems justified to use them.
REFERENCES
R. Crandall and C. Pomerance, Prime Numbers - A Computational Perspective, Springer-Verlag, New York, 2001, p. 73.
LINKS
Chris K. Caldwell, Yuanyou Cheng, Determining Mills' Constant and a Note on Honaker's Problem, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.1
MATHEMATICA
Flatten[Select[Partition[Prime[Range[50]], 3, 1], Divisible[Times@@ Rest[ #]+1, #[[1]]]&]] (* Harvey P. Dale, Feb 03 2015 *)
PROG
(PARI) forprime(p=3, default(primelimit), (nextprime(p+1)*p+1)%precprime(p-1)||print1(precprime(p-1)", "p", "nextprime(p+1)", ")) \\ For PARI/GP version >= 2.6, default(primelimit) can be omitted.
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
M. F. Hasler, Jul 24 2013
STATUS
approved