

A258272


The smallest amount which cannot be made with fewer than n British coins.


2



1, 3, 8, 18, 38, 88, 188, 388, 588, 788, 988, 1188, 1388, 1588, 1788, 1988, 2188, 2388, 2588, 2788, 2988, 3188, 3388, 3588, 3788, 3988, 4188, 4388, 4588, 4788
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

a(n) is the smallest amount (in pence) that cannot be made with fewer than n coins.
The coins included are those in common circulation in the UK: 1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).


LINKS

Matthew Scroggs, Table of n, a(n) for n = 1..5005


EXAMPLE

The smallest value that requires 4 coins is 18p (10p, 5p, 2p and 1p). Therefore a(4)=18.


PROG

(Python) #
coins = [1, 2, 5, 10, 20, 50, 100, 200]
need = [0]
while True:
....next = len(need)
....n_need = next
....for coin in coins:
........if coin>next:
............break
........n_need = min(n_need, 1+need[nextcoin])
....need.append(n_need)
....if n_need == len(seq):
........print(next)


CROSSREFS

Cf. A258274.
Sequence in context: A051633 A131051 A172265 * A117727 A117713 A128552
Adjacent sequences: A258269 A258270 A258271 * A258273 A258274 A258275


KEYWORD

nonn


AUTHOR

Matthew Scroggs, May 25 2015


STATUS

approved



