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 A321794 #15 Jun 23 2020 01:23:50 %S A321794 2,1,4,5,6,1,2,4,2,4,4,7,3,3,5,14,13,8,14,18,4,5,19,10,11,10,13,25,2, %T A321794 21,18,19,15,10,11,15,4,39,23,33,33,39,28,4,34,32,8,32,18,12,26,53,10, %U A321794 11,22,33,26,3,54,42,14,39,18,59,66,6,50,61,23,69,8,59,3,21 %N A321794 Josephus problem: Positions of records in the rows of A321781. %C A321794 a(n) gives the initial position j of a person in the Josephus problem such that the largest minimal elimination parameter q, meaning every q-th person being executed, is needed among all initial positions 1 <= j <= n, to make position a(n) survive. The corresponding value of q is given by A321793. %H A321794 Hugo Pfoertner, <a href="/A321794/b321794.txt">Table of n, a(n) for n = 2..400</a> %H A321794 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a> %Y A321794 Cf. A321781, A321793. %K A321794 nonn %O A321794 2,1 %A A321794 _Hugo Pfoertner_, Nov 19 2018