A386243 a(n) is the smallest possible g(k) in a set of increasing numbers g(1) < g(2) < ... < g(k) having Frobenius number n.

3, 5, 5, 7, 4, 7, 5, 9, 7, 9, 5, 9, 8, 11, 10, 11, 7, 13, 6, 9, 11, 10, 7, 13, 11, 11, 8, 13, 7, 13, 9, 13, 14, 13, 11, 13, 12, 13, 11, 17, 8, 17, 12, 17, 14, 16, 9, 19, 11, 17, 14, 17, 10, 13, 9, 17, 15, 17, 11, 18, 15, 19, 16, 15, 12, 16, 16, 18, 11, 17, 10, 19, 17, 17, 18, 18, 15

Offset

1,1

Links

David A. Corneth, Table of n, a(n) for n = 1..415

David A. Corneth, All solutions for n = 1..415 where no number is a divisor of another number

Shunichi Matsubara, The Computational Complexity of the Frobenius Problem, arXiv:1602.05657, 2016. [Background information]

Wikipedia, Coin problem

Example

a(15) = 10 because the set {6,7,10} has the Frobenius number of 15. No set of the form {..., 9} or {..., 8}, etc. has a Frobenius number of 15.

Crossrefs

Cf. A028387, A079326, A124506, A138984, A138985.

Sequence in context: A282624 A179858 A141501 * A277776 A103988 A285204

Adjacent sequences: A386240 A386241 A386242 * A386244 A386245 A386246

Keyword

nonn,nice

Author

Gordon Hamilton, Jul 16 2025

Extensions

More terms from David A. Corneth, Jul 16 2025

Status

approved