|
Search: id:A064099
|
|
|
| A064099 |
|
Ceiling(log(3+2*n)/log(3)) |
|
+0
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; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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
|
|
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! - njas, Jun 25, 2002
|
|
MAPLE
|
A064099 := n->ceil(evalf(log(3+2*n)/log(3)));
|
|
CROSSREFS
|
Cf. A003462 ((3^n-1)/2, the inverse)
Sequence in context: A127971 A086673 A101787 this_sequence A134021 A130255 A082527
Adjacent sequences: A064096 A064097 A064098 this_sequence A064100 A064101 A064102
|
|
KEYWORD
|
nice,easy,nonn
|
|
AUTHOR
|
Eugene McDonnell (EEMcD(AT)AOL.com), Sep 16 2001
|
|
|
Search completed in 0.002 seconds
|
