cp's OEIS Frontend

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.

A383618 Smallest prime gap whose first occurrence is >= 2^n.

This page as a plain text file.
%I A383618 #17 May 04 2025 03:22:51
%S A383618 1,4,6,6,8,8,10,16,16,16,26,30,36,38,46,46,66,74,80,94,108,116,142,
%T A383618 156,158,166,186,200,228,254,264,294,298,334,362,388,388,422,466,488,
%U A383618 510,536,576,590,632,676,708,764,782,796,848,926,928,968,1006,1048
%N A383618 Smallest prime gap whose first occurrence is >= 2^n.
%C A383618 In the case of a prime gap that straddles a power of 2, we take the lower end of the gap, as listed in A000230.
%H A383618 Brian Kehrig, <a href="/A383618/b383618.txt">Table of n, a(n) for n = 1..65</a>
%H A383618 The Prime Gap List, <a href="https://primegap-list-project.github.io/lists/prime-gaps-first-occurrences/">First occurrence prime gaps</a>
%e A383618 a(3) = 6, because prime gaps of 1, 2, and 4 all appear before 2^3 = 8, but a prime gap of 6 does not occur until later.
%Y A383618 Cf. A000230.
%K A383618 nonn
%O A383618 1,2
%A A383618 _Brian Kehrig_, May 02 2025