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 A163799 #33 Jul 06 2025 14:53:30 %S A163799 15,145,149,243,259,449,1921,2787,15871,18563,26459,191515,283269, %T A163799 741343,844805 %N A163799 a(n) is the n-th J_19-prime (Josephus_19 prime). %C A163799 Place the numbers 1..N (N>=2) on a circle and cyclicly mark the 19th unmarked number until all N numbers are marked. The order in which the N numbers are marked defines a permutation; N is a J_19-prime if this permutation consists of a single cycle of length N. %C A163799 There are 15 J_19-primes in the interval 2..1000000 only. No formula is known; the J_19-primes have been found by exhaustive search. %D A163799 R. L. Graham, D. E. Knuth & O. Patashnik, Concrete Mathematics (1989), Addison-Wesley, Reading, MA. Sections 1.3 & 3.3. %H A163799 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 A163799 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 A163799 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a> %e A163799 All J_19-primes are odd. %Y A163799 Cf. A163782 through A163798 and A163800 for J_2- through J_18- and J_20-primes. %K A163799 nonn,more %O A163799 1,1 %A A163799 _Peter R. J. Asveld_, Aug 04 2009