|
|
A167809
|
|
Number of admissible bases in the postage stamp problem for n denominations and h = 2 stamps.
|
|
6
|
|
|
1, 2, 5, 17, 65, 292, 1434, 7875, 47098, 305226, 2122983, 15752080, 124015310, 1031857395, 9041908204, 83186138212, 801235247145, 8059220936672, 84463182889321
(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 are 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
|
a(17) from simple depth-first search by Jukka Kohonen, Jun 16 2016
a(18)-a(19) from depth-first search by Jukka Kohonen, Jul 30 2016
|
|
STATUS
|
approved
|
|
|
|