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 A165258 #2 Mar 30 2012 17:35:24 %S A165258 1,3,2,3,2,5,2,5,4,7,4,7,4,9,8,9,6,11,6,9,8,9,6,11,6,11,8,11,6,13,8, %T A165258 13,8,13,12,13,10,15,10,17,10,17,10,15,14,15,10,17,10,17,10,15,12,17, %U A165258 12,15,14,15,12,17,12,15,16,15,12,19,12,19,14,19,14,19,14,19,14,21,16,19,14 %N A165258 Minimum value such that n occurs a(n) times, subject to the constraint that gcd(n,a(n)) = 1. %o A165258 (PARI) count(v,t,n)=local(r);for(i=1,n,if(v[i]==t,r++));r %o A165258 nexta(v,n)=for(i=1,n-1,if(gcd(i,n)==1&&count(v,i,n-1)<v[i],return(i))) %o A165258 v=vector(100);v[1]=1;v[2]=3;for(n=3,100,v[n]=nexta(v,n));v %Y A165258 Cf. A001462, A116548. %K A165258 nonn %O A165258 1,2 %A A165258 _Franklin T. Adams-Watters_, Sep 11 2009