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

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, 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, 1, 6, 7, 9, 5, 7, 7, 3, 3, 2, 9, 7, 8, 6, 4, 7, 3, 0, 0, 7, 3, 0

Offset

1,2

Comments

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

Links

Paolo Xausa, Table of n, a(n) for n = 1..10000

Carl Pomerance, A Tale of Two Sieves, Notices of the American Mathematical Society, Volume 43, Number 12, December 1996, pp. 1473-1485 (see p. 1482).

Eric Weisstein's World of Mathematics, Number Field Sieve.

Wikipedia, General number field sieve.

Formula

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

Example

1.9229994270765445097621844143734794511891590046658...

Mathematica

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

Crossrefs

Cf. A394662, A394664.

Sequence in context: A110543 A319026 A228584 * A021056 A132719 A293577

Adjacent sequences: A394660 A394661 A394662 * A394664 A394666 A394667

Keyword

nonn,cons,easy

Author

Paolo Xausa, Mar 27 2026

Status

approved