|
| |
|
|
A064099
|
|
Ceiling(log(3+2*n)/log(3))
|
|
3
| |
|
|
1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Minimal number of weighings to detect a heavier or lighter counterfeit coin among n coins.
|
|
|
REFERENCES
| J. G. Mauldon, Strong solutions for the counterfeit coin problem. IBM Research Report RC 7476 (#31437) 9/15/78, IBM Thomas J. Watson Research Center, P. O. Box 218, Yorktown Heights, N. Y. 10598
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
|
FORMULA
| a(n) = A134021(n+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 19 2007
|
|
|
EXAMPLE
| It would be nice to have some examples showing how the sequence is related to the coin problem! - N. J. A. Sloane (njas(AT)research.att.com), Jun 25, 2002
|
|
|
MAPLE
| A064099 := n->ceil(evalf(log(3+2*n)/log(3)));
|
|
|
PROG
| (PARI) { for (n=0, 1000, write("b064099.txt", n, " ", ceil(log(3 + 2*n)/log(3))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 07 2009]
|
|
|
CROSSREFS
| Cf. A003462 ((3^n-1)/2, the inverse)
Sequence in context: A156752 A086673 A101787 * A134021 A130255 A082527
Adjacent sequences: A064096 A064097 A064098 * A064100 A064101 A064102
|
|
|
KEYWORD
| nice,easy,nonn
|
|
|
AUTHOR
| Eugene McDonnell (EEMcD(AT)AOL.com), Sep 16 2001
|
| |
|
|
