A394662 Decimal expansion of the constant characterizing the complexity of the special number field sieve (SNFS) factoring algorithm.

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

Offset

1,2

Comments

The SNFS 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, Special number field sieve.

Formula

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

Example

1.5262856567377758237440562825862360118878758943839...

Mathematica

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

Crossrefs

Cf. A394663, A394664.

Sequence in context: A217702 A018247 A152025 * A021099 A021023 A378200

Adjacent sequences: A394659 A394660 A394661 * A394663 A394664 A394666

Keyword

nonn,cons,easy

Author

Paolo Xausa, Mar 27 2026

Status

approved