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 A163787 #22 Aug 05 2024 14:11:46 %S A163787 5,11,21,35,85,103,161,231,543,1697,1995,2289,37851,49923,113443, %T A163787 236091,285265 %N A163787 a(n) is the n-th J_7-prime (Josephus_7 prime). %C A163787 Place the numbers 1..N (N>=2) on a circle and cyclicly mark the 7th unmarked number until all N numbers are marked. The order in which the N numbers are marked defines a permutation; N is a J_7-prime if this permutation consists of a single cycle of length N. %C A163787 There are 17 J_7-primes in the interval 2..1000000 only. No formula is known; the J_7-primes have been found by exhaustive search. %D A163787 R. L. Graham, D. E. Knuth & O. Patashnik, Concrete Mathematics (1989), Addison-Wesley, Reading, MA. Sections 1.3 & 3.3. %H A163787 P. R. J. Asveld, <a href="http://dx.doi.org/10.1016/j.dam.2011.07.019">Permuting Operations on Strings and Their Relation to Prime Numbers</a>, Discrete Applied Mathematics 159 (2011) 1915-1932. %H A163787 P. R. J. Asveld, <a href="https://citeseerx.ist.psu.edu/pdf/9d8542763057ef03a22b57f87085d69497ddaf46">Permuting Operations on Strings-Their Permutations and Their Primes</a>, Twente University of Technology, 2014. <a href="http://doc.utwente.nl/67513">University link</a>. %H A163787 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a> %e A163787 All J_7-primes are odd. %Y A163787 Cf. A163782 through A163786 for J_2- through J_6-primes. %Y A163787 Cf. A163788 through A163800 for J_8- through J_20-primes. %K A163787 nonn,more %O A163787 1,1 %A A163787 _Peter R. J. Asveld_, Aug 05 2009