login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A098092
Unique solution to the [10,3] postage stamp problem (showing that V(10,3) = 155).
0
1, 2, 6, 8, 19, 28, 40, 43, 91, 103
OFFSET
0,2
COMMENTS
This sequence supplemented the solutions listed in Lunnon's 1969 paper. The Math Magic link includes a more recent set of solutions. The Darts Contest link include more extensive sequences, but not necessarily solutions.
LINKS
W. F. Lunnon, A Postage Stamp Problem, Comput. J. 12 (1969) 377-380.
J. L. Seldon, The Postage Stamp Problem, Letter to the Editor dated Jun 07 1972, The Computer Journal, Volume 15 No 4 Page 361.
CROSSREFS
Cf. A001213.
Sequence in context: A103015 A323859 A365918 * A221316 A106164 A216205
KEYWORD
fini,full,nonn
AUTHOR
John Seldon (johnseldon(AT)onetel.com), Sep 14 2004
STATUS
approved