A396402 Numbers k such that there is a record number of values of j with 1 <= j <= k and GCD(j,k) = 1 such that the number of terms in the greedy Egyptian fraction representation of j/k (A050205(k,j)) is the minimum possible (A097847(k,j)).

1, 3, 5, 7, 11, 13, 17, 19, 23, 29, 37, 43, 47, 53, 59, 67, 71, 79, 83, 89, 97, 101, 107, 127, 131, 137, 149, 157, 173, 179, 181, 191, 199, 223, 227, 239, 263, 269, 307, 311, 313, 331, 337, 359, 367, 379, 383, 409, 419, 433, 439, 487, 547, 563, 569, 577, 607

Offset

1,2

Comments

Numbers k such that A000010(k)-A395994(k) sets a new record.

Are all terms except a(1) prime?

Links

Pontus von Brömssen, Table of n, a(n) for n = 1..122

Index entries for sequences related to Egyptian fractions.

Crossrefs

Cf. A000010, A050205, A097847, A395994, A396399.

Sequence in context: A226181 A363286 A120637 * A278454 A378018 A064534

Adjacent sequences: A396399 A396400 A396401 * A396403 A396404 A396405

Keyword

nonn

Author

Pontus von Brömssen, May 24 2026

Status

approved