cp's OEIS Frontend

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.

Previous Showing 11-14 of 14 results.

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

Views

Author

N. J. A. Sloane

Keywords

Comments

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.

References

  • 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).

Links

Crossrefs

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).

Extensions

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

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

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Sep 27 2011

Keywords

Comments

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

Links

Crossrefs

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

Extensions

More terms from Hakan Icoz, Nov 13 2020

A196094 a(0) = 1; a(n) = A001212(n) + 1 for n > 0.

Original entry on oeis.org

1, 3, 5, 9, 13, 17, 21, 27, 33, 41, 47, 55, 65, 73, 81, 93, 105, 117, 129, 141, 153, 165, 181, 197, 213
Offset: 0

Views

Author

N. J. A. Sloane, Sep 27 2011

Keywords

Comments

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

Links

Crossrefs

Cf. A001212, A123509, A234941.
Row m=2 of the array A196416.

Extensions

Definition amended by Georg Fischer, Jan 25 2020

A195618 a(0) = 1; a(n) = A001208(n) + 1 for n > 0.

Original entry on oeis.org

1, 4, 9, 16, 27, 36, 53, 70, 90, 113, 147, 173, 213, 260, 303, 355, 419, 477, 549, 634, 715, 806, 903, 1013, 1128, 1255, 1383, 1525, 1679, 1842, 2011, 2189, 2383, 2585, 2802, 3021, 3257, 3509, 3773, 4044, 4327, 4629, 4942, 5273, 5607, 5961, 6335, 6724, 7121
Offset: 0

Views

Author

N. J. A. Sloane, Sep 23 2011

Keywords

Comments

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

Links

Crossrefs

Cf. A001208.
Column n=3 of the array A196416.

Extensions

Definition amended by Georg Fischer, Jan 25 2020
Previous Showing 11-14 of 14 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.