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 A376754 #28 Jul 09 2025 05:06:34 %S A376754 2,3,4,8,13,24,43,78,142,261,479,894,1674,3118,5873,11102,20992,39830, %T A376754 75906,144652,276720,529865,1016535,1954167,3761091,7250277,13993031, %U A376754 27042169,52313384,101320082,196422988,381154209,740280217,1438969498,2799310690,5449726356 %N A376754 Length of n-th run of primes in A376198. %C A376754 Theorem: a(n) is the number of steps needed for the prime A376751(n) to "double" in the normal sequence of primes. More precisely, if A376751(n) = prime(j), then a(n) = A063124(j). For example, A376751(8) = 521 = prime(98), and A063124(98) = 78 = a(8). (The result seems to be off by 1 at n = 4, for reasons I don't understand yet.) - _N. J. A. Sloane_, Oct 04 2024 %o A376754 (Python) # uses code in A376750 %o A376754 print([out[4] for out in list(islice(A376750_4gen(), 15))]) # _Michael S. Branicky_, Oct 03 2024 %Y A376754 Cf. A376198-A376201, A376750-A376753. %Y A376754 See also A063124. %K A376754 nonn %O A376754 1,1 %A A376754 _N. J. A. Sloane_, Oct 03 2024 %E A376754 a(14)-a(33) from _Michael S. Branicky_, Oct 04 2024 %E A376754 a(34)-a(36) from _Michael S. Branicky_, Oct 07 2024