A001209 -id:A001209 - cp's OEIS frontend

A196069 a(n) = A001209(n) + 1.

1, 5, 13, 25, 45, 72, 115, 166, 235, 327, 428, 548, 709, 874, 1095, 1384, 1651, 1936, 2305, 2783, 3325, 3813, 4369, 5131, 5893, 6746, 7881, 8914, 9920, 11082, 12377, 13933, 15658, 17243, 18893, 21062, 23446, 25554, 27979, 31348, 33982, 36807, 39915, 43593

Offset: 0

N. J. A. Sloane, Sep 27 2011

nonn

Lunnon sometimes works with this sequence rather than A001209. A001209 is the main entry.

Hakan Icoz, Table of n, a(n) for n = 0..54
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

Cf. A001209.

A row or column of the array A196416 (possibly with 1 subtracted from it).

More terms from Hakan Icoz, Nov 13 2020

A001212 a(n) = solution to the postage stamp problem with n denominations and 2 stamps.

Original entry on oeis.org

2, 4, 8, 12, 16, 20, 26, 32, 40, 46, 54, 64, 72, 80, 92, 104, 116, 128, 140, 152, 164, 180, 196, 212

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

a(20)=152: There is only one set of 20 denominations covering all sums through 152: {1, 3, 4, 5, 8, 14, 20, 26, 32, 38, 44, 50, 56, 62, 68, 71, 72, 73, 75, 76}. - Tim Peters (tim.one(AT)comcast.net), Oct 04 2006

Gardner, M. The Sixth Book of Mathematical Games from Scientific American. Chicago, IL: University of Chicago Press, p. 115 (Coins of the Realm), 1984.
R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Alter, Letter to N. J. A. Sloane, Mar 25 1977
R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp J 36(2) (1993) 117-126
M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3.
Erich Friedman, Postage stamp problem
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs
F. H. Kierstead, Jr.,, The Stamp Problem, J. Rec. Math., Vol. ?, Year ?, page 298. [Annotated and scanned copy]
J. Kohonen, A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases, arXiv preprint arXiv:1403.5945, 2014 and J. Int. Seq. 17 (2014) # 14.6.8.
J. Kohonen, J. Corander, Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications, J. Integer Seq., 17 (2014), Article 14.3.4.
J. Kohonen, Early Pruning in the Restricted Postage Stamp Problem, arXiv preprint arXiv:1503.03416, 2015
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
W. F. Lunnon, A postage stamp problem [Annotated scanned copy]
J. P. Robinson, Some postage stamp 2-bases, JIS 12 (2009) 09.1.1.
E. S. Selmer, Letter to N. J. A. Sloane, Sep 10 1991
Eric Weisstein's World of Mathematics, Postage stamp problem
Mingjia Yang, An experimental walk in patterns, partitions, and words, Ph. D. Dissertation, Rutgers University (2020).

Postage stamp sequences: A001208 A001209 A001210 A001211 A001212 A001213 A001214 A001215 A001216 A005342 A005343 A005344 A014616 A053346 A053348 A075060 A084192 A084193
Cf. A006638, A123509.
Equals A196094(n) - 1 and A234941(n+1)-2.
A row or column of the array A196416 (possibly with 1 subtracted from it).

Corrected a(17). Added a(18) and a(19) from Challis. - R. J. Mathar, Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(20) from Tim Peters (tim.one(AT)comcast.net), Oct 04 2006
Added terms a(21) and a(22) from Challis and Robinson. John P Robinson (john-robinson(AT)uiowa.edu), Feb 19 2010
Added term a(23) from Challis and Robinson's July 2013 addendum, by Jukka Kohonen, Oct 25 2013
Added a(24) from Kohonen and Corander (2013). - N. J. A. Sloane, Jan 08 2014

A001208 a(n) = solution to the postage stamp problem with 3 denominations and n stamps.

Original entry on oeis.org

3, 8, 15, 26, 35, 52, 69, 89, 112, 146, 172, 212, 259, 302, 354, 418, 476, 548, 633, 714, 805, 902, 1012, 1127, 1254, 1382, 1524, 1678, 1841, 2010, 2188, 2382, 2584, 2801, 3020, 3256, 3508, 3772, 4043, 4326, 4628, 4941, 5272, 5606, 5960, 6334, 6723, 7120

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp. J. 36(2) (1993) 117-126.
Erich Friedman, Postage stamp problem
F. H. Kierstead, Jr.,, The Stamp Problem, J. Rec. Math., Vol. ?, Year ?, page 298. [Annotated and scanned copy]
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
Eric Weisstein's World of Mathematics, Postage stamp problem

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.
Equals A195618 - 1.
A row or column of the array A196416 (possibly with 1 subtracted from it).

c2 :=array(0..8,[3,3,5,5,7,6,8,8,10]) ; c3 :=array(0..8,1..2,[[1,1],[1,1],[2,1],[2,1],[3,1],[2,2],[3,2],[3,2],[4,2]]); c4 :=array(0..8,1..3,[[0,0,0],[0,0,1],[1,0,1],[1,0,2],[2,0,2],[2,1,2],[3,1,2],[3,1,3],[4,1,3]]) ; for n from 23 to 100 do r := n mod 9 ; t := iquo(n,9) ; a2 := 6*t+c2[r] ; a3 := (2*t+c3[r,1])+(2*t+c3[r,2])*a2 ; printf("%a,",4*t+c4[r,1]+(2*t+c4[r,2])*a2+(3*t+c4[r,3])*a3) ; end: # R. J. Mathar, Apr 01 2006

ClearAll[c2, c3, c4, a]; Evaluate[ Array[c2, 9, 0]] = {3, 3, 5, 5, 7, 6, 8, 8, 10}; Evaluate[ Array[c3, {9, 2}, {0, 1}]] = {{1, 1}, {1, 1}, {2, 1}, {2,1}, {3, 1}, {2, 2}, {3, 2}, {3, 2}, {4, 2}}; Evaluate[ Array[c4, {9, 3}, {0, 1}]] = {{0, 0, 0}, {0, 0, 1}, {1, 0,1}, {1, 0, 2}, {2, 0, 2}, {2, 1, 2}, {3, 1, 2}, {3, 1, 3}, {4, 1,3}}; Evaluate[ Array[a, 19]] = {3, 8, 15, 26, 35, 52, 69, 89, 112, 146, 172, 212, 259, 302, 354, 418, 476, 548, 633}; a[n_] := (r = Mod[n, 9]; t = Quotient[n, 9]; a2 = 6t + c2[r]; a3 = (2t + c3[r, 1]) + (2t + c3[r, 2])*a2; 4t + c4[r, 1] + (2t + c4[r, 2])*a2 + (3t + c4[r, 3])*a3); Table[a[n], {n, 1, 48}] (* Jean-François Alcover, Dec 19 2011, after R. J. Mathar's Maple program *)

Maple recursion program valid for n>=23 from Challis added by R. J. Mathar, Apr 01 2006
At least 64 terms are known, see Friedman link.
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
More terms from Jean Gaumont (jeangaum87(AT)yahoo.com), Apr 16 2006

A001213 a(n) is the solution to the postage stamp problem with n denominations and 3 stamps.

Original entry on oeis.org

3, 7, 15, 24, 36, 52, 70, 93, 121, 154, 186, 225, 271, 323, 385, 450, 515, 606, 684, 788, 865, 977, 1091, 1201, 1361

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
Erich Friedman, Postage stamp problem
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
Eric Weisstein's World of Mathematics, Postage stamp problem

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.

A row or column of the array A196416 (possibly with 1 subtracted from it).

Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
More terms from Al Zimmermann, Feb 20 2002
Further terms from Friedman web site, Jun 20 2003
Incorrect value of a(17) removed by Al Zimmermann, Nov 08 2009
a(17)-a(25) from Friedman added by Robert Price, Jul 19 2013

A001210 a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.

Original entry on oeis.org

5, 16, 36, 70, 126, 216, 345, 512, 797, 1055, 1475, 2047, 2659, 3403, 4422, 5629, 6865, 8669, 10835, 12903, 15785, 18801, 22456, 26469, 31108, 36949, 42744, 49436, 57033, 66771, 75558, 86303, 96852, 110253, 123954, 140688, 158389, 178811, 197293, 223580

Offset: 1

N. J. A. Sloane

nonn

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

Additional terms a(30) through a(67) are available on line at Challis and Robinson. - John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Robert Price, Table of n, a(n) for n = 1..67
R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp. J. 36(2) (1993) 117-126.
M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010]
Erich Friedman, Postage stamp problem
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
Eric Weisstein's World of Mathematics, Postage stamp problem

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.

A row or column of the array A196416 (possibly with 1 subtracted from it).

Terms up to a(29) from Challis added by R. J. Mathar, Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(30)-a(67) from Challis and Robinson added by Robert Price, Jul 19 2013

A001211 a(n) is the solution to the postage stamp problem with 6 denominations and n stamps.

Original entry on oeis.org

6, 20, 52, 108, 211, 388, 664, 1045, 1617, 2510, 3607, 5118, 7066, 9748, 12793, 17061, 22342, 28874, 36560, 45745, 57814, 72997, 87555, 106888, 129783

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp. J. 36(2) (1993) 117-126.
M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3.
Erich Friedman, Postage stamp problem
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
Eric Weisstein's World of Mathematics, Postage stamp problem

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.

A row or column of the array A196416 (possibly with 1 subtracted from it).

a(11)-a(15) from Challis added by R. J. Mathar, Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(16)-a(25) from Challis and Robinson added by John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010

A001214 a(n) is the solution to the postage stamp problem with n denominations and 4 stamps.

Original entry on oeis.org

4, 10, 26, 44, 70, 108, 162, 228, 310, 422, 550, 700, 878, 1079, 1344, 1606, 1944, 2337, 2766, 3195, 3668, 4251, 4923, 5631, 6429

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp. J. 36(2) (1993) 117-126
M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010]
Erich Friedman, Postage stamp problem
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.

A row or column of the array A196416 (possibly with 1 subtracted from it).

a(10) from Challis added by R. J. Mathar, Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(11) from Challis & Robinson added by John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010
a(12)-a(25) from Friedman added by Robert Price, Jul 19 2013

A001215 a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.

Original entry on oeis.org

5, 14, 35, 71, 126, 211, 336, 524, 726, 1016, 1393, 1871, 2494, 3196, 4063, 5113, 6511, 7949, 9865, 11589

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp. J. 36(2) (1993) 117-126
M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3.
Erich Friedman, Postage stamp problem
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.

A row or column of the array A196416 (possibly with 1 subtracted from it).

a(9) from Challis added by R. J. Mathar, Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(10) from Challis and Robinson added by John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010
a(11)-a(20) from Friedman added by Robert Price, Jul 19 2013

A001216 a(n) = solution to the postage stamp problem with n denominations and 6 stamps.

Original entry on oeis.org

6, 18, 52, 114, 216, 388, 638, 1007, 1545, 2287

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010]
Erich Friedman, Postage stamp problem
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.

A row or column of the array A196416 (possibly with 1 subtracted from it).

Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
Added terms a(8) and a(9) from Challis and Robinson. John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010
a(10) from Friedman by Robert Price, Jul 19 2013

A005342 a(n) = solution to the postage stamp problem with n denominations and 7 stamps.

Original entry on oeis.org

7, 23, 69, 165, 345, 664, 1137, 1911

Offset: 1

N. J. A. Sloane

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. K. Guy, Unsolved Problems in Number Theory, C12.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
Erich Friedman, Postage stamp problem
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.

Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004

a(8) from Challis and Robinson by Robert Price, Jul 19 2013

cp's OEIS Frontend

A196069 a(n) = A001209(n) + 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A001212 a(n) = solution to the postage stamp problem with n denominations and 2 stamps.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A001208 a(n) = solution to the postage stamp problem with 3 denominations and n stamps.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Extensions

A001213 a(n) is the solution to the postage stamp problem with n denominations and 3 stamps.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A001210 a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A001211 a(n) is the solution to the postage stamp problem with 6 denominations and n stamps.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A001214 a(n) is the solution to the postage stamp problem with n denominations and 4 stamps.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A001215 a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A001216 a(n) = solution to the postage stamp problem with n denominations and 6 stamps.

Views

Author

Keywords

Comments