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 A097587 #6 Mar 07 2013 11:24:51 %S A097587 1,1,1,1,2,1,1,1,1,2,2,1,1,1,2,1,1,1,1,1,1,1,2,1,1,2,2,1,2,1,1,1,4,1, %T A097587 1,1,2,1,1,1,1,2,1,2,1,3,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2, %U A097587 1,2,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,2,1,2,1,1,1,1,1,1,1,1,1,1,2,1,1,1 %N A097587 a(n)= floor(P(k)/P(n)) with P(k)=Fortunate prime numbers for P(n)# (A005235). %C A097587 Conjecture : a(n) is always < 8. %Y A097587 Cf. A005235. %K A097587 base,nonn %O A097587 1,5 %A A097587 _Pierre CAMI_, Aug 29 2004