id:A011542 - OEIS Search Results

Search: id:A011542

Displaying 1-1 of 1 results found.

page 1

Minimal number of coins needed to pay n cents using coins of sizes 1, 5, 10, 25, 50 cents.

+0
3

1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Index entries for sequences related to making change.`
	CROSSREFS	`Cf. A053344.` `Sequence in context: A078978 A053840 A010883 this_sequence A053344 A092196 A100878` `Adjacent sequences: A011539 A011540 A011541 this_sequence A011543 A011544 A011545`
	KEYWORD	`nonn`
	AUTHOR	`Frank J. Stadermann (df6s(AT)HRZPUB.th-darmstadt.de)`

page 1

Search completed in 0.002 seconds

Last modified July 19 08:04 EDT 2008. Contains 142098 sequences.

AT&T Labs Research