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 A097588 #10 Aug 18 2017 19:23:44 %S A097588 1,1,1,1,1,1,1,1,1,2,1,1,2,1,1,1,1,1,1,1,1,1,1,2,1,1,1,2,2,1,1,2,2,1, %T A097588 1,1,1,1,1,1,1,1,3,1,2,1,1,1,1,1,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,3, %U A097588 1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,2 %N A097588 a(n)=floor(P(k)/P(n)) with P(k)=lesser Fortunate numbers for P(n)# (A055211). %C A097588 Conjecture : a(n) is always < 8. %H A097588 Pierre CAMI, <a href="/A097588/b097588.txt">Table of n, a(n) for n = 2..2000</a> %e A097588 a(11) = floor(73/31) = 2, A055211(11) = 73 prime(11) = 31, %e A097588 2*3*5*7*11*13*17*19*23*29*31-73 is prime and 73 is the smallest odd number k such that p(11)# - k is prime. %Y A097588 Cf. A055211. %K A097588 base,nonn %O A097588 2,10 %A A097588 _Pierre CAMI_, Aug 29 2004