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 A272800 #16 Jun 24 2020 16:57:09 %S A272800 0,2,0,2,3,2,0,2,4,2,3,2,0,2,5,2,3,2,0,2,4,2,3,2,6,2,0,2,3,2,7,2,4,2, %T A272800 3,2,5,2,0,2,3,2,8,2,4,2,3,2,0,2,6,2,3,2,5,2,4,2,3,2,9,2,0,2,3,2,10,2, %U A272800 4,2,3,2,7,2,5,2,3,2,0,2,4,2,3,2,6,2 %N A272800 Flavius Josephus factor of n. %C A272800 This sequence is analogous to the smallest prime factor of n. If n is a member of A000960, a(n) = 0, otherwise a(n) = the (k+1)-st step that rejects n from Flavius Josephus' sieve. %C A272800 The n-values of records of this sequence are given by A100287 (see 2004 comment by Sloane). %H A272800 Danny Rorabaugh, <a href="/A272800/b272800.txt">Table of n, a(n) for n = 1..1000</a> %H A272800 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a> %o A272800 (Sage) # Function that returns an array of the first n terms. %o A272800 def A272800(n): %o A272800 A, B, k = [0]*n, range(n), 1 %o A272800 while k<len(B): %o A272800 for i in range(floor(len(B)/(k + 1))): %o A272800 A[B.pop(k*(i + 1))] = k + 1 %o A272800 k += 1 %o A272800 return A %o A272800 # _Danny Rorabaugh_, May 13 2016 %Y A272800 Cf. A000960, A100002, A100287. %K A272800 nonn %O A272800 1,2 %A A272800 _Max Barrentine_, May 06 2016