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 A145194 #5 Mar 30 2012 18:49:13 %S A145194 1,1,4,20,41,104,479,1146,7603,16521,91146,188021,188021,1861979, %T A145194 14122396,43294271,203450521,203450521,5877278646,5900065104, %U A145194 16886393229 %N A145194 Least k for which Omega(6k-1) + Omega(6k+1) >= n. %C A145194 a(22) <= 170499674479. a(23) <= 1307169596354. a(24) <= 3178914388021. a(25) <= 3178914388021. a(26) <= 43614705403646 [From _Donovan Johnson_, Feb 17 2010] %e A145194 When k=1,2 and 3, Omega(6k-1) + Omega(6k+1) = 2. When k=4, Omega(6k-1) + Omega(6k+1) = 3, so a(3)=4. %t A145194 Maxie=0; For[x=6, x<10000001, x+=6,S=0;T=0; For[k=1, k< Length[FactorInteger[x-1]]+1,k++,S+= FactorInteger[x-1][[k]][[2]]]; For[m=1, m< Length[FactorInteger[x+1]]+1,m++,T+= FactorInteger[x+1][[m]][[2]]]; If[S+T>Maxie,Print[x/6," ",S+T];Maxie=S+T]] %Y A145194 Cf. A145193 %K A145194 nonn %O A145194 1,3 %A A145194 _Arran Fernandez_, Oct 03 2008 %E A145194 a(15)-a(21) from _Donovan Johnson_, Feb 17 2010