id:A057536 - OEIS Search Results

Search: id:A057536

Displaying 1-1 of 1 results found.

page 1

Minimal number of coins needed to pay n Euro-cents using the Euro currency (coins and bills of size 1, 2, 5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000, 20000, 50000 cents).

+0
1

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

	OFFSET	`1,3`
	LINKS	`Index entries for sequences related to making change.`
	FORMULA	`a(n) = floor(n/50000) + floor([n mod 50000]/20000) + floor([{n mod 50000} mod 20000]/10000) + ... + floor([{n mod 50000}mod 20000 ... mod 5]/2) + ([n mod 50000] mod 20000)... mod 2`
	EXAMPLE	`a(57) = 3 because to pay 57 cents at least 5 coins are needed: 1 of 50 cents, 1 of 5 cents and 1 of 2 cents.`
	CROSSREFS	`Cf. A011542, A001299.` `Adjacent sequences: A057533 A057534 A057535 this_sequence A057537 A057538 A057539` `Sequence in context: A050333 A143999 A137419 this_sequence A014420 A029289 A029328`
	KEYWORD	`easy,nonn`
	AUTHOR	`Thomas Brendan Murphy (murphybt(AT)tcd.ie), Sep 06 2000`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research