This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A364607 #41 Oct 03 2023 03:49:10 %S A364607 1,5,18,25 %N A364607 Denominations of a 4-coin system that returns the fewest coins in change on average. %C A364607 In 1995, Thomas Young, along with students Jeff Greenfield, Joe Culbert, and David Raabe, explored the idea of the best 4-coin system for making change for a dollar. They assumed that each value for change (from 1 cent to 99 cents) was equally likely and, using an original Turbo Pascal program, calculated the average number of coins returned for every possible set of 4 coin denominations. Their result was announced via the essay, "Change the Dime not the Dollar." %C A364607 The average number of coins required to return 1..99 cents is A339333(99,4)/99 = 389/99. - _Pontus von Brömssen_, Aug 13 2023 %H A364607 Thomas Young, <a href="/A364607/a364607_1.pdf">A Turbo Pascal program to find the optimal coin system</a>. %H A364607 Thomas Young, <a href="/A364607/a364607_2.pdf">Change the Dime Not the Dollar</a>. %Y A364607 Cf. A208953, A339333, A366013. %K A364607 nonn,full,fini %O A364607 1,2 %A A364607 _Thomas Young_, Aug 06 2023