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 A067568 #13 May 05 2018 05:38:52
%S A067568 0,1,2,5,9,11,15
%N A067568 Numbers n such that A000009(n) divides A022629(n).
%C A067568 Next term > 10^4. - _Joerg Arndt_, Oct 14 2014
%C A067568 Next term, if it exists, is greater than 1000000. - _Vaclav Kotesovec_, May 05 2018
%o A067568 (PARI)
%o A067568 N=1002; q='q+O('q^N);
%o A067568 t1=Vec(prod(m=1,N,1+q^m)); \\ A000009
%o A067568 t2=Vec(prod(m=1,N,1+m*q^m)); \\ A022629
%o A067568 for(k=1,N, if(t2[k]%t1[k]==0,print1(k-1,", ")) );
%o A067568 \\ _Joerg Arndt_, Oct 14 2014
%K A067568 nonn,more
%O A067568 1,3
%A A067568 _Naohiro Nomoto_, Jan 30 2002