login
A038523
A minimal sequence of weights with distinct weighings, with limit of two weights per pan.
1
2, 3, 9, 25, 67, 167, 427, 966
OFFSET
0,1
REFERENCES
Discovered by Denis Borris and Ed Pegg Jr.
EXAMPLE
The first n weights give the number 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: A242271 A056198 A143742 * A358410 A361863 A096237
KEYWORD
more,nice,nonn
AUTHOR
STATUS
approved