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 A163797 #31 Jul 05 2025 11:24:32 %S A163797 3,5,7,39,93,267,557,2389,2467,4059,4681,6213,70507,151013,282477, %T A163797 421135,1272901 %N A163797 a(n) is the n-th J_17-prime (Josephus_17 prime). %C A163797 Place the numbers 1..N (N>=2) on a circle and cyclicly mark the 17th unmarked number until all N numbers are marked. The order in which the N numbers are marked defines a permutation; N is a J_17-prime if this permutation consists of a single cycle of length N. %C A163797 There are 16 J_17-primes in the interval 2..1000000 only. No formula is known; the J_17-primes have been found by exhaustive search. %D A163797 R. L. Graham, D. E. Knuth & O. Patashnik, Concrete Mathematics (1989), Addison-Wesley, Reading, MA. Sections 1.3 & 3.3. %H A163797 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 A163797 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 A163797 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a> %e A163797 All J_17-primes are odd. %Y A163797 Cf. A163782 through A163796 for J_2- through J_16-primes. %Y A163797 Cf. A163798 through A163800 for J_18- through J_20-primes. %K A163797 nonn,more %O A163797 1,1 %A A163797 _Peter R. J. Asveld_, Aug 04 2009 %E A163797 a(17) from _Jinyuan Wang_, Jul 05 2025