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 A085651 #38 Jul 17 2024 18:40:08
%S A085651 44,49,75,98,116,147,171,244,260,275,315,332,363,387,475,476,507,524,
%T A085651 531,548,549,603,604,636,692,724,725,747,764,774,819,844,845,846,867,
%U A085651 908,924,931,963,1035,1075,1083,1179,1196,1251,1274,1275,1324,1340,1395
%N A085651 Index of the first of two successive 2's in A005361.
%C A085651 Numbers such that bigomega(n) - omega(n) = 1 and bigomega(n+1) - omega(n+1) = 1, where bigomega(n) is the number of primes dividing n (counted with repetition) and omega(n) is the number of distinct primes dividing n. - _Michel Lagneau_, Dec 17 2011
%C A085651 Elements of A060687 whose successor is also in A060687. - _Emmanuel Vantieghem_, Mar 05 2017
%C A085651 This sequence has 3548 terms up to 10^5, 35340 up to 10^6, 353147 up to 10^7, and 3531738 up to 10^8, suggesting a natural density around 0.0353.... - _Charles R Greathouse IV_, Mar 06 2017
%H A085651 Amiram Eldar, <a href="/A085651/b085651.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Indranil Ghosh)
%H A085651 Indranil Ghosh, <a href="/A085651/a085651_1.txt">Python program to generate the sequence</a>.
%t A085651 Select[Range[1400],PrimeOmega[#]-PrimeNu[#] == 1 && PrimeOmega[#+1] - PrimeNu[#+1] == 1 &] (* _Indranil Ghosh_, Mar 05 2017 *)
%t A085651 SequencePosition[Table[PrimeOmega[n]-PrimeNu[n],{n,1500}],{1,1}][[;;,1]] (* _Harvey P. Dale_, Jul 17 2024 *)
%o A085651 (PARI) isok(n) = (bigomega(n)-omega(n) == 1) && (bigomega(n+1)-omega(n+1) == 1); \\ _Michel Marcus_, Mar 05 2017
%o A085651 (PARI) is(n)=factorback(factor(n)[,2])==2 && factorback(factor(n+1)[,2])==2 \\ _Charles R Greathouse IV_, Mar 06 2017
%Y A085651 Cf. A005361, A060687.
%K A085651 easy,nonn
%O A085651 1,1
%A A085651 _Amarnath Murthy_, _Jason Earls_, Jul 11 2003