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 A377512 #4 Nov 13 2024 17:26:20
%S A377512 4,3,2,5,3,1,4,1,2,3,2,3,1,2,1,1,2,2,1,1,2,1,3,2,1,3,1,4,3,1,2,1,1,1,
%T A377512 3,1,3,1,1,2,2,2,1,1,2,3,1,1,2,1,2,2,1,2,1,1,1,1,7,1,1,2,1,3,2,1,2,1,
%U A377512 1,1,1,5,1,1,1,1,1,1,1,2,2,3,1,2,1,2
%N A377512 a(n) = number of iterations of x -> 2 x - 3 to reach a nonprime, starting with prime(n).
%C A377512 See A377120 for a guide to related sequences.
%e A377512 prime(3) = 5 -> 7 -> 11 -> 19 -> 35 = 5*7, so a(1) = 4.
%t A377512 Table[p = Prime[n]; c = 1; While[p = 2*p + 7; PrimeQ[p], c++]; c, {n, 200}]
%Y A377512 Cf. A377120, A377510, A377511, A377513, A377514.
%K A377512 nonn
%O A377512 1,1
%A A377512 _Clark Kimberling_, Nov 05 2024