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 A069805 #13 Sep 15 2018 05:30:56 %S A069805 2,3,5,9,6,8,8,10,12,14,12,18,14,15,21,48,18,20,20,28,22,24,24,30,28, %T A069805 27,30,32,30,40,32,44,34,35,38,100,38,39,40,42,42,54,44,45,50,51,48, %U A069805 80,50,52,54,60,54,56,56,66,58,60,60,72,62,65,68,192,66,70,68,72,70,78,72 %N A069805 Smallest k>n such that tau(n) divides tau(k)=A000005(k). %H A069805 Ivan Neretin, <a href="/A069805/b069805.txt">Table of n, a(n) for n = 1..10000</a> %o A069805 (PARI) for(s=1,100,n=s+1; while(frac(numdiv(n)/numdiv(s))>0,n++); print1(n,","); ) %o A069805 (PARI) a(n) = my(k=n+1); while(numdiv(k)%numdiv(n), k++); k; \\ _Michel Marcus_, Sep 15 2018 %Y A069805 Cf. A000005. %Y A069805 Cf. A140635 (without k>n constraint). %K A069805 easy,nonn %O A069805 1,1 %A A069805 _Benoit Cloitre_, May 01 2002