|
|
A167810
|
|
Number of admissible basis in the postage stamp problem for n denominations and h = 3 stamps.
|
|
6
|
|
|
1, 3, 13, 86, 760, 8518, 116278, 1911198, 37063964, 835779524, 21626042510, 635611172160, 21033034941826, 777710150809009
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
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.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009
|
|
EXTENSIONS
|
Terms a(1) to a(12) verified and new terms a(13) and a(14) added by Herbert Kociemba, Jul 14 2010
|
|
STATUS
|
approved
|
|
|
|