Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098092
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098092 Unique solution to the [10,3] postage stamp problem (showing that V(10,3) = 155). +0
1
1, 2, 6, 8, 19, 28, 40, 43, 91, 103 (list; graph; listen)
OFFSET

0,2

COMMENT

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.

REFERENCES

W. F. Lunnon, A Postage Stamp Problem, 1969, The Computer Journal, Volume 12, Page 377.

J. L. Seldon, The Postage Stamp Problem, Letter to the Editor dated Jun 07 1972, The Computer Journal, Volume 15 No 4 Page 361.

LINKS

Math Magic Problem of the Month (April 2003)

W. F. Lunnon, A Postage Stamp Problem.

Al Zimmermann Darts Contest (Final Report)

CROSSREFS

Cf. A001213.

Sequence in context: A163911 A077638 A103015 this_sequence A106164 A072230 A028332

Adjacent sequences: A098089 A098090 A098091 this_sequence A098093 A098094 A098095

KEYWORD

fini,full,nonn

AUTHOR

John Seldon (johnseldon(AT)onetel.com), Sep 14 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research