A366360 Irregular triangle read by rows where each row is coin denominations which make amounts 1 to 99 using the smallest total number of coins by the greedy algorithm.
1, 1, 10, 1, 11, 1, 5, 22, 1, 5, 23, 1, 3, 11, 37, 1, 3, 11, 38, 1, 3, 7, 16, 40, 1, 3, 7, 16, 41, 1, 3, 7, 18, 44, 1, 3, 7, 18, 45, 1, 3, 8, 20, 44, 1, 3, 8, 20, 45, 1, 2, 5, 11, 25, 62, 1, 2, 5, 11, 25, 63, 1, 2, 5, 13, 29, 64, 1, 2, 5, 13, 29, 65, 1, 2, 5, 8, 17, 27, 63
Offset: 1
Examples
Triangle begins: k=1 2 3 4 5 n=1: 1 n=2: 1, 10 n=3: 1, 11 n=4: 1, 5, 22 n=5: 1, 5, 23 n=6: 1, 3, 11, 37 n=7: 1, 3, 11, 38 n=8: 1, 3, 7, 16, 40 Rows n=6 and n=7 have length d=4 and are the two sets of denominations which, with the greedy algorithm, make amounts 1 to 99 using the minimum total A339334(99,4) = 410 coins.
Links
- Kevin Ryde, Table of n, a(n) for rows 1..1000 (row lengths d=1..10 and some of d=11), flattened
- Kevin Ryde, C Code
- Jeffrey Shallit, What This Country Needs is an 18ยข Piece, The Mathematical Intelligencer, 25-2, pages 20-23, 2003, figure 2 rows to d=7, and also author's copy, 2002.
Programs
-
C
/* See links */
Comments