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 A101787 #8 May 23 2024 04:26:42
%S A101787 1,1,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,5,5,
%T A101787 5,5,5,5,5,5,5,5,5,5,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,9,9,9,9,9,9,
%U A101787 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,10,10,10,10,10
%N A101787 a(n) = |S(n)| where S(n) = {i : 1 <= i <= n and 4*i-1 and 8*i-1 are primes}.
%C A101787 Number of Lucasian primes that do not exceed 4*n-1. [Corrected by _Amiram Eldar_, May 23 2024]
%t A101787 Accumulate[Table[Boole[And @@ PrimeQ[{4, 8}*i - 1]], {i, 1, 100}]] (* _Amiram Eldar_, May 23 2024 *)
%Y A101787 Cf. A002515, A101788.
%K A101787 easy,nonn
%O A101787 1,3
%A A101787 Douglas Stones (dssto1(AT)student.monash.edu.au), Dec 16 2004
%E A101787 Name corrected by _Amiram Eldar_, May 23 2024