A394663 - OEIS

%I #8 Mar 29 2026 03:45:11

%S 1,9,2,2,9,9,9,4,2,7,0,7,6,5,4,4,5,0,9,7,6,2,1,8,4,4,1,4,3,7,3,4,7,9,

%T 4,5,1,1,8,9,1,5,9,0,0,4,6,6,5,8,0,0,7,7,0,0,6,1,8,8,8,2,5,9,3,8,8,9,

%U 1,6,7,9,5,7,7,3,3,2,9,7,8,6,4,7,3,0,0,7,3,0

%N Decimal expansion of the constant characterizing the complexity of the general number field sieve (GNFS) factoring algorithm.

%C The GNFS algorithm has complexity O(exp(c*(log(n))^(1/3)*(log(log(n))^(2/3)))), where c is the present constant.

%H Paolo Xausa, <a href="/A394663/b394663.txt">Table of n, a(n) for n = 1..10000</a>

%H Carl Pomerance, <a href="https://www.ams.org/notices/199612/pomerance.pdf">A Tale of Two Sieves</a>, Notices of the American Mathematical Society, Volume 43, Number 12, December 1996, pp. 1473-1485 (see p. 1482).

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/NumberFieldSieve.html">Number Field Sieve</a>.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/General_number_field_sieve">General number field sieve</a>.

%F Equals (64/9)^(1/3).

%e 1.9229994270765445097621844143734794511891590046658...

%t First[RealDigits[CubeRoot[64/9], 10, 100]]

%Y Cf. A394662, A394664.

%K nonn,cons,easy

%O 1,2

%A _Paolo Xausa_, Mar 27 2026