|
| |
|
|
A038523
|
|
A minimal sequence of weights with distinct weighings, with limit of two weights per pan.
|
|
1
| | |
|
|
|
OFFSET
| 0,1
|
|
|
REFERENCES
| Discovered by Denis Borris and Ed Pegg Jr.
|
|
|
LINKS
| Ed Pegg Jr., COMMENTARY ON WEEKLY PUZZLES
|
|
|
EXAMPLE
| The first n weights give the # of distinct combinations given in A037255. The weights 1, 3, 9, 27, 81, 243, 729 also work for this problem, but are not distinct. Further numbers are calculable.
|
|
|
CROSSREFS
| Cf. A037255.
Sequence in context: A111240 A056198 A143742 * A096237 A177928 A057231
Adjacent sequences: A038520 A038521 A038522 * A038524 A038525 A038526
|
|
|
KEYWORD
| more,nice,nonn
|
|
|
AUTHOR
| Ed Pegg Jr (ed(AT)mathpuzzle.com)
|
| |
|
|
