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 A106752 #6 Mar 31 2012 14:42:50 %S A106752 0,0,1,0,1,2,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,2,1,1,2,1,2,1,1, %T A106752 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 %N A106752 Numbers of prime factors of k, k defined in A117078. %C A106752 a(n) = 0 only for n = 1, 2 and 4. %H A106752 Remi Eismann, <a href="/A106752/b106752.txt">Table of n, a(n) for n = 1..10000</a> %F A106752 a(n) = numbers of factors of A117078(n). A117078(n) : smallest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists. %e A106752 For a(1), k=0 thus a(1)=0, %e A106752 For a(3), k=3 thus a(3)=1, %e A106752 For a(11), k=25=5*5 thus a(11)=2. %Y A106752 Cf. A117078, A117563, A118534, A118144, A118123. %K A106752 nonn %O A106752 1,6 %A A106752 _Rémi Eismann_, Jun 22 2007, Feb 14 2008