A034259 - OEIS

A034259

Smallest m such that A034258(m) >= n.

1, 4, 9, 14, 16, 20, 24, 27, 32, 34, 38, 40, 46, 49, 51, 57, 58, 62, 65, 68, 72, 77, 80, 84, 87, 90, 93, 94, 100, 104, 108, 111, 114, 115, 118, 125, 125, 128, 130, 135, 140, 143, 145, 147, 153, 156, 159, 161, 168, 168, 172, 176, 176, 180, 187, 187, 192, 195, 200

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..59.

Thomas Bloom, Problem 391, Erdős Problems.

Erdős problems database contributors, Erdős problem database, see no. 391.

Richard K. Guy and John L. Selfridge, Factoring factorial n, Amer. Math. Monthly, 105 (1998), 766-767.

CROSSREFS

Cf. A034258, A034260.

Sequence in context: A050986 A284956 A261445 * A312988 A010452 A312989

Adjacent sequences: A034256 A034257 A034258 * A034260 A034261 A034262