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 A177835 #12 Jul 25 2023 04:04:15
%S A177835 17,37,41,67,73,97,131,137,139,149,163,193,197,257,263,269,277,281,
%T A177835 293,337,353,389,401,449,521,523,547,577,593,641,643,673,769,773,1031,
%U A177835 1033,1039,1049,1051,1061,1063,1069,1091,1093,1097,1109,1123,1129,1153,1163,1171
%N A177835 Primes p for which a smaller prime q exists with A000120(q) >= 2*A000120(p)-1.
%C A177835 See A177836 for a comparison with A095075.
%H A177835 Amiram Eldar, <a href="/A177835/b177835.txt">Table of n, a(n) for n = 1..10000</a>
%p A177835 read("transforms") ;A000120 := proc(n) wt(n) ; end proc:
%p A177835 isA177835 := proc(p) if isprime(p) then q := 2 ; while q < p do if A000120(q) >= 2*A000120(p)-1 then return true; end if; q := nextprime(q) ; end do: return false; else false; end if; end proc:
%p A177835 for i from 1 to 2000 do if isA177835(ithprime(i)) then printf("%d,",ithprime(i)) ; end if; end do: # _R. J. Mathar_, May 31 2010
%t A177835 With[{b = DigitCount[Prime[Range[200]], 2, 1]}, Rest@ Prime[Position[2*b - 1 - FoldList[Max, b], _?(# <= 0 &)] // Flatten]] (* _Amiram Eldar_, Jul 25 2023 *)
%Y A177835 Cf. A000120, A014499, A095075, A061712, A177768, A177836.
%K A177835 nonn,easy,base
%O A177835 1,1
%A A177835 _Vladimir Shevelev_, May 14 2010
%E A177835 keyword:base and more terms added by _R. J. Mathar_, May 31 2010