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.

Showing 1-5 of 5 results.

A167810 Number of admissible basis in the postage stamp problem for n denominations and h = 3 stamps.

Original entry on oeis.org

1, 3, 13, 86, 760, 8518, 116278, 1911198, 37063964, 835779524, 21626042510, 635611172160, 21033034941826, 777710150809009
Offset: 1

Views

Author

Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009

Keywords

Comments

A basis 1 = b_1 < b_2 ... < b_n is admissible if all the values 1 <= x <= b_n is obtainable as a sum of at most h (not necessarily distinct) numbers in the basis.

References

  • R. K. Guy, Unsolved Problems in Number Theory, C12.

Crossrefs

Other enumerations with different parameters: A167809 (h = 2), A167810 (h = 3), A167811 (h = 4), A167812 (h = 5), A167813 (h = 6), A167814 (h = 7).
For h = 2, cf. A008932.
A152112 is essentially the same sequence by definition. [From Herbert Kociemba, Jul 14 2010]

Extensions

Terms a(1) to a(12) verified and new terms a(13) and a(14) added by Herbert Kociemba, Jul 14 2010

A167811 Number of admissible basis in the postage stamp problem for n denominations and h = 4 stamps.

Original entry on oeis.org

1, 4, 26, 291, 4752, 109640, 3380466, 136053274, 6963328612, 444765731559
Offset: 1

Views

Author

Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009

Keywords

Comments

A basis 1 = b_1 < b_2 ... < b_n is admissible if all the values 1 <= x <= b_n is obtainable as a sum of at most h (not necessarily distinct) numbers in the basis.

References

  • R. K. Guy, Unsolved Problems in Number Theory, C12.

Crossrefs

Other enumerations with different parameters: A167809 (h = 2), A167810 (h = 3), A167811 (h = 4), A167812 (h = 5), A167813 (h = 6), A167814 (h = 7).
For h = 2, cf. A008932.

A167812 Number of admissible basis in the postage stamp problem for n denominations and h = 5 stamps.

Original entry on oeis.org

1, 5, 45, 750, 20881, 880325, 54329413, 4727396109, 563302698378
Offset: 1

Views

Author

Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009

Keywords

Comments

A basis 1 = b_1 < b_2 ... < b_n is admissible if all the values 1 <= x <= b_n is obtainable as a sum of at most h (not necessarily distinct) numbers in the basis.

References

  • R. K. Guy, Unsolved Problems in Number Theory, C12.

Crossrefs

Other enumerations with different parameters: A167809 (h = 2), A167810 (h = 3), A167811 (h = 4), A167812 (h = 5), A167813 (h = 6), A167814 (h = 7).
For h = 2, cf. A008932.

A167813 Number of admissible basis in the postage stamp problem for n denominations and h = 6 stamps.

Original entry on oeis.org

1, 6, 71, 1694, 73126, 5235791, 593539539, 102141195784
Offset: 1

Views

Author

Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009

Keywords

Comments

A basis 1 = b_1 < b_2 ... < b_n is admissible if all the values 1 <= x <= b_n is obtainable as a sum of at most h (not necessarily distinct) numbers in the basis.

References

  • R. K. Guy, Unsolved Problems in Number Theory, C12.

Crossrefs

Other enumerations with different parameters: A167809 (h = 2), A167810 (h = 3), A167811 (h = 4), A167812 (h = 5), A167813 (h = 6), A167814 (h = 7).
For h = 2, cf. A008932.

A167814 Number of admissible basis in the postage stamp problem for n denominations and h = 7 stamps.

Original entry on oeis.org

1, 7, 105, 3407, 217997, 24929035, 4863045067
Offset: 1

Views

Author

Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009

Keywords

Comments

A basis 1 = b_1 < b_2 ... < b_n is admissible if all the values 1 <= x <= b_n is obtainable as a sum of at most h (not necessarily distinct) numbers in the basis.

References

  • R. K. Guy, Unsolved Problems in Number Theory, C12.

Crossrefs

Other enumerations with different parameters: A167809 (h = 2), A167810 (h = 3), A167811 (h = 4), A167812 (h = 5), A167813 (h = 6), A167814 (h = 7).
For h = 2, cf. A008932.
Showing 1-5 of 5 results.