A053344 -id:A053344 - cp's OEIS frontend

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

0, 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, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 2, 3

Offset: 0

Frank J. Stadermann (df6s(AT)HRZPUB.th-darmstadt.de)

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Index entries for sequences related to making change.
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).

Cf. A053344.

f[n_]:=Total[Quotient[Most[FoldList[Mod,n,{50,25,10,5,1}]],{50,25,10,5,1}]];Table[f[n],{n,1,84}]  (* Geoffrey Critzer, May 04 2013 *)
Table[Min[Total/@FrobeniusSolve[{1,5,10,25,50},n]],{n,0,110}] (* Harvey P. Dale, Nov 10 2018 *)

G.f.: -(6*x^49 -x^48 -x^47 -x^46 -x^45 +4*x^44 -x^43 -x^42 -x^41 -x^40 +3*x^39 -x^38 -x^37 -x^36 -x^35 +4*x^34 -x^33 -x^32 -x^31 -x^30 +3*x^29 -x^28 -x^27 -x^26 -x^25 +5*x^24 -x^23 -x^22 -x^21 -x^20 +4*x^19 -x^18 -x^17 -x^16 -x^15 +3*x^14 -x^13 -x^12 -x^11 -x^10 +4*x^9 -x^8 -x^7 -x^6 -x^5 +3*x^4 -x^3 -x^2 -x -1)*x / (x^51-x^50-x+1). - Alois P. Heinz, Aug 04 2014

A174140 Numbers congruent to k mod 25, where 10 <= k <= 24.

Original entry on oeis.org

10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 110, 111, 112, 113, 114, 115, 116

Offset: 1

Rick L. Shepherd, Mar 09 2010

Numbers whose partition into parts of sizes 1, 5, 10, and 25 having a minimal number of parts includes at least one part of size 10.
For each number the partition is unique.
Complement of A174141.
Amounts in cents requiring at least one dime when the minimal number of coins is selected from pennies, nickels, dimes, and quarters (whether usage of bills for whole-dollar amounts is permitted or not).

Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for sequences related to making change.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1).

Cf. A174138, A174139, A174141, A047201 (requires at least one part of size 1 (penny)), A008587, A053344 (minimal number of parts), A001299 (number of all such partitions).

Flatten[Table[Range[10,24]+25n,{n,0,5}]] (* Harvey P. Dale, Jun 12 2012 *)

Vec(x*(10 + x + x^2 + x^3 + x^4 + x^5 + x^6 + x^7 + x^8 + x^9 + x^10 + x^11 + x^12 + x^13 + x^14 + x^15) / ((1 - x)^2*(1 + x + x^2)*(1 + x + x^2 + x^3 + x^4)*(1 - x + x^3 - x^4 + x^5 - x^7 + x^8)) + O(x^60)) \\ Colin Barker, Oct 25 2019

a(n+15) = a(n) + 25 for n >= 1.
From Colin Barker, Oct 25 2019: (Start)
G.f.: x*(10 + x + x^2 + x^3 + x^4 + x^5 + x^6 + x^7 + x^8 + x^9 + x^10 + x^11 + x^12 + x^13 + x^14 + x^15) / ((1 - x)^2*(1 + x + x^2)*(1 + x + x^2 + x^3 + x^4)*(1 - x + x^3 - x^4 + x^5 - x^7 + x^8)).
a(n) = a(n-1) + a(n-15) - a(n-16) for n>16.
(End)

A174141 Numbers congruent to k mod 25, where 0 <= k <= 9.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 150, 151, 152, 153, 154

Offset: 1

Rick L. Shepherd, Mar 09 2010

Numbers whose partition into parts of sizes 1, 5, 10, and 25 having a minimal number of parts does not include a part of size 10.
For each number the partition is unique.
Complement of A174140.
Amounts in cents not including a dime when the minimal number of coins is selected from pennies, nickels, dimes, and quarters (whether usage of bills for whole-dollar amounts is permitted or not).

Index entries for sequences related to making change.
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).

Cf. A174138, A174139, A174140, A047201 (requires at least one part of size 1 (penny)), A008587, A053344 (minimal number of parts), A001299 (number of all such partitions).

LinearRecurrence[{1,0,0,0,0,0,0,0,0,1,-1},{0,1,2,3,4,5,6,7,8,9,25},70] (* Harvey P. Dale, May 30 2014 *)

a(n+10) = a(n) + 25 for n >= 1.

a(n)= +a(n-1) +a(n-10) -a(n-11). G.f. x^2*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+16*x^9) / ( (1+x)*(1+x+x^2+x^3+x^4)*(x^4-x^3+x^2-x+1)*(x-1)^2 ). - R. J. Mathar, Oct 08 2011

A067995 Minimal number of coins needed to pay exactly n cents using coins of sizes 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage from 1 to 100 cents).

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 2, 3, 3, 3, 4, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 3, 4, 4, 4, 5, 3, 4, 4, 4, 5, 3, 4, 4, 4, 5, 1, 2, 2, 2, 3, 2

Offset: 1

Rick L. Shepherd, Feb 06 2002

The U.S.A. issued the following unusual denomination coins during the 19th century: 2-cent pieces, 1864-1873; 3-cent pieces, 1851-1889; and 20-cent pieces, 1875-1878.

			a(69) = 5 because to pay exactly 69 cents at least 5 coins are needed: e.g. 1 of 50 cents, 1 of 10 cents, 1 of 5 cents and 2 of 2 cents.

R. S. Yeoman, A Guide Book of United States Coins, Ed. Kenneth Bressett, 53rd Edition (2000). New York: St. Martin's Press, 1999. pp. 104-106, 135. (also known as The Official Red Book of United States Coins)

Ray Chandler, Table of n, a(n) for n = 1..1000
Jean-Paul Delahaye, Quelles pièces pour faire l'appoint ?, French edition of the Scientific American, Pour la Science, N°335, septembre 2005.
Jeffrey Shallit, What this country needs is an 18c piece, The Mathematical Intelligencer, June 2003, Volume 25, Issue 2, pp 20-23.
Index entries for sequences related to making change.
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).

Cf. A053344, A067996, A067997.

A174138 Numbers congruent to {5,6,7,8,9,15,16,17,18,19} mod 25.

Original entry on oeis.org

5, 6, 7, 8, 9, 15, 16, 17, 18, 19, 30, 31, 32, 33, 34, 40, 41, 42, 43, 44, 55, 56, 57, 58, 59, 65, 66, 67, 68, 69, 80, 81, 82, 83, 84, 90, 91, 92, 93, 94, 105, 106, 107, 108, 109, 115, 116, 117, 118, 119, 130, 131, 132, 133, 134, 140, 141, 142, 143, 144, 155, 156, 157

Offset: 1

Rick L. Shepherd, Mar 09 2010

Numbers whose partition into parts of sizes 1, 5, 10, and 25 having a minimal number of parts includes a part of size 5.
For each number the partition is unique and exactly one part is of size 5.
Complement of A174139.
Amounts in cents requiring a nickel when the minimal number of coins is selected from pennies, nickels, dimes, and quarters (whether usage of bills for whole-dollar amounts is permitted or not).
For each n >= 0, floor(n/25) parts of size 25 (quarters) occur in the partition with minimal number of these parts (regardless of whether partition includes part of size 5).

			As 15 = 10 + 5, 15 is a term since 5 is included and all other candidate partitions have more than two parts. Similarly, as 30 = 25 + 5, 30 is a term. However, 45 = 25 + 10 + 10 is not a term as it contains no part of size 5.

Index entries for sequences related to making change.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,1,-1).

Cf. A174139, A174140, A174141, A047201 (requires at least one part of size 1 (penny)), A008587, A053344 (minimal number of parts), A001299 (number of all such partitions).

[n : n in [1..200] | n mod 25 in [5, 6, 7, 8, 9, 15, 16, 17, 18, 19]]; // Vincenzo Librandi, Mar 22 2015

Table[n + 9 + 5 Floor[(Floor[(n - 1)/5] - 1)/2] + 10 Floor[Floor[(n - 1)/5]/2], {n, 100}] (* Wesley Ivan Hurt, Mar 22 2015 *)

a(10+n) = a(n) + 25 for n >= 1.
a(n) = a(n-1) + a(n-10) - a(n-11). G.f.: x*(5+x+x^2+x^3+x^4+6*x^5+x^6+x^7+x^8+x^9+6*x^10)  / ( (1+x) *(x^4+x^3+x^2+x+1) *(x^4-x^3+x^2-x+1)*(x-1)^2 ). - R. J. Mathar, Oct 08 2011
a(n) = n+9+5*floor((floor((n-1)/5)-1)/2)+10*floor(floor((n-1)/5)/2). - Wesley Ivan Hurt, Mar 22 2015

A174139 Numbers congruent to {0,1,2,3,4,10,11,12,13,14,20,21,22,23,24} mod 25.

Original entry on oeis.org

0, 1, 2, 3, 4, 10, 11, 12, 13, 14, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 35, 36, 37, 38, 39, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 60, 61, 62, 63, 64, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 85, 86, 87, 88, 89, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 110, 111, 112

Offset: 1

Rick L. Shepherd, Mar 09 2010

Numbers whose partition into parts of sizes 1, 5, 10, and 25 having a minimal number of parts does not include a part of size 5.
For each number the partition is unique.
Complement of A174138.
Amounts in cents not including a nickel when the minimal number of coins is selected from pennies, nickels, dimes, and quarters (whether usage of bills for whole-dollar amounts is permitted or not).
For each n >= 0, floor(n/25) parts of size 25 (quarters) occur in the partition with minimal number of these parts (regardless of whether partition includes part of size 5).
First differs from A032955 at n = 76. - Avi Mehra, Oct 08 2020

Index entries for sequences related to making change.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1).

Cf. A174138, A174140, A174141, A047201 (requires at least one part of size 1 (penny)), A008587, A053344 (minimal number of parts), A001299 (number of all such partitions).

Select[Range[0, 112], Mod[Mod[#, 25], 10] < 5 &] (* Amiram Eldar, Oct 08 2020 *)

{ my(table=[0,1,2,3,4, 10,11,12,13,14, 20,21,22,23,24]);
a(n) = my(r);[n,r]=divrem(n-1,15); 25*n + table[r+1]; } \\ Kevin Ryde, Oct 08 2020

a(15+n) = a(n) + 25 for n >= 1.
From  R. J. Mathar, Oct 08 2011: (Start)
a(n) = +a(n-1) +a(n-15) -a(n-16).
G.f.: x^2*(1 +x +x^2 +x^3 +6*x^4 +x^5 +x^6 +x^7 +x^8 +6*x^9 +x^10 +x^11 +x^12 +x^13+x^14) / ( (1+x+x^2) *(x^4+x^3+x^2+x+1) *(x^8-x^7+x^5-x^4+x^3-x+1) *(x-1)^2). (End)

A260688 a(n) = the least number of pieces of currency of denominations .01, .05, .10, .25, 1, 5, 10, 20, 50, 100 that the greedy algorithm uses to make n times .01 (n "cents") in change.

Original entry on oeis.org

0, 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, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 5, 6, 7, 8, 9

Offset: 0

Edward Minnix III, Nov 15 2015

nonn

US Treasury, Denominations of Coins
US Treasury, Denominations of Paper Currency

Cf. A053344, A067997, A080897, A108536.

def how_many(cents):
    #d = denominations
    d = ['$0.01', '$0.05', '$0.10', '$0.25',
         '$1', '$5', '$10', '$20', '$50', '$100']
    coins = {coin: 100*float(str(coin)[1:]) for coin in d}
    how_many = {d[i]: 0 for i in range(10)}
    while len(d) != 0:
        how_many[d[-1]] = cents // coins[d[-1]]
        cents %= coins[d[-1]]
        d.pop()
    return int(sum(how_many.values()))

Edited by N. J. A. Sloane, Apr 24 2016

A358012 Minimal number of coins needed to pay n cents using coins of denominations 1 and 5 cents.

Original entry on oeis.org

0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 9, 10, 11, 12, 13, 10, 11, 12, 13, 14, 11, 12, 13, 14, 15, 12, 13, 14, 15, 16, 13, 14, 15, 16, 17, 14, 15, 16, 17, 18, 15, 16

Offset: 0

Sandra Snan, Oct 24 2022

Sequence consists of runs of five consecutive integers: 0..4, 1..5, 2..6, 3..7, etc.

Index entries for sequences related to making change.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,1,-1).

Cf. A002266, A010874.

Cf. A076314 (1,10 cents), A053344 (1,5,10,25 cents).

Array[Total@ QuotientRemainder[#, 5] &, 77, 0] (* Michael De Vlieger, Nov 03 2022 *)

a(n) = n\5 + n%5 \\ Thomas Scheuerle, Oct 24 2022

a(n) = vecsum(divrem(n, 5)); \\ Michel Marcus, Nov 03 2022

def a(n): return n//5 + n%5 # Michael S. Branicky, Nov 03 2022

Sum of quotient and remainder of n/5.

a(n) = A002266(n) + A010874(n).

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A174140 Numbers congruent to k mod 25, where 10 <= k <= 24.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A174141 Numbers congruent to k mod 25, where 0 <= k <= 9.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A067995 Minimal number of coins needed to pay exactly n cents using coins of sizes 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage from 1 to 100 cents).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A174138 Numbers congruent to {5,6,7,8,9,15,16,17,18,19} mod 25.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A174139 Numbers congruent to {0,1,2,3,4,10,11,12,13,14,20,21,22,23,24} mod 25.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A260688 a(n) = the least number of pieces of currency of denominations .01, .05, .10, .25, 1, 5, 10, 20, 50, 100 that the greedy algorithm uses to make n times .01 (n "cents") in change.

Views

Author

Keywords

Links

Crossrefs

Programs

Python

Extensions

A358012 Minimal number of coins needed to pay n cents using coins of denominations 1 and 5 cents.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs