This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A288209 #31 Jan 16 2023 14:49:04 %S A288209 1,2,5,7,10,14,15,23,29,46,61 %N A288209 Numbers k such that prime(k) * prime(k+1) mod prime(k+2) is odd. %C A288209 Finite? Full? %C A288209 Next term, if it exists, is greater than 1026351685. %C A288209 From _Robert Israel_, Jun 19 2017: (Start) %C A288209 Numbers k such that floor(A001223(k+1)*A031131(k)/prime(k+2)) is odd. %C A288209 Cramér's conjecture implies the sequence is finite. (End) %H A288209 Wikipedia, <a href="https://en.wikipedia.org/wiki/Cram%C3%A9r%27s_conjecture">Cramér's conjecture</a> %e A288209 The first five primes are 2, 3, 5, 7, 11. %e A288209 We see that 2 * 3 = 1 mod 5, so 1 (corresponding to the first prime, 2) is in the sequence. %e A288209 We see that 3 * 5 = 1 mod 7, so 2 (corresponding to the second prime, 3) is in the sequence. %e A288209 But 5 * 7 = 2 mod 11, so 3 (corresponding to the third prime, 5) is not in the sequence. %p A288209 P:= select(isprime, [2,seq(i,i=3..10^6,2)]): %p A288209 select(n -> (P[n]*P[n+1] mod P[n+2])::odd, [$1..nops(P)-2]); # _Robert Israel_, Jun 19 2017 %t A288209 Select[Range[1000], OddQ[Mod[Prime[#] Prime[# + 1], Prime[# + 2]]] &] (* _Alonso del Arte_, Jun 06 2017 *) %t A288209 Position[Partition[Prime[Range[70]],3,1],_?(OddQ[Mod[#[[1]]#[[2]], #[[3]]]]&),1,Heads->False]//Flatten (* _Harvey P. Dale_, Aug 11 2017 *) %o A288209 (PARI) isok(n) = (((prime(n) * prime(n + 1)) % prime(n + 2)) % 2); \\ _Michel Marcus_, Jun 07 2017 %Y A288209 Cf. A001223, A006094, A031131, A182126. %K A288209 nonn,more %O A288209 1,2 %A A288209 _Zak Seidov_, Jun 06 2017