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 A096292 #9 Aug 21 2020 09:04:59 %S A096292 3,5,11,17,29,41,59,71,101,107,137,149,179,191,197,227,239,269,281, %T A096292 311,347,419,431,461,521,569,599,617,641,659,809,821,827,857,881,1019, %U A096292 1031,1049,1061,1091,1151,1229,1277,1289,1301,1319,1427,1451,1481,1487,1607 %N A096292 Primes p such that p!-1 is divisible by the next prime larger than p. %C A096292 This sequence includes A001359 as a subset, since the lesser of twin primes always satisfy this relation. The smallest number in this sequence that is not in A001359 is 7841. The only other known differences are 594278556271608991 and 4259842839142238791410741595983041626644087433. %H A096292 Jeppe Stig Nielsen, <a href="/A096292/b096292.txt">Table of n, a(n) for n = 1..600</a> %H A096292 Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_270.htm">Puzzle 270</a>. %e A096292 17 is here because 17!-1 is divisible by 19 and 19 is the next prime larger than 17. %o A096292 (PARI) p=2; forprime(q=3, , prod(j=1, p, Mod(j, q)) == 1 && print1(p, ", "); p=q) \\ _Jeppe Stig Nielsen_, Oct 04 2019 %Y A096292 Cf. A001359, A286181. %K A096292 nonn %O A096292 1,1 %A A096292 Stuart Gascoigne (stuart.g(AT)scoigne.com), Jun 24 2004