A293949 Arises in a coin-weighing problem.

1, 1, 3, 6, 16, 41, 99, 235, 565, 1347, 3187, 7515, 17691, 41523, 97240, 227361, 530859, 1237881, 2883475, 6710758, 15606075, 36268307, 84239608, 195567275, 453832309, 1052784046, 2441461427, 5660381126, 13120263173, 30405643251, 70451852483, 163217723702, 378083386517

Offset

0,3

Comments

The maximum number of coins that can be processed in n weighings where all coins are real except for one LHR-coin starting in an unknown state. - Robert Price, Nov 30 2017

Links

Table of n, a(n) for n=0..32.

Tanya Khovanova and Konstantin Knop, Coins that Change Their Weights, arXiv:1611.09201 [math.CO], 2016. See Section 7.

Crossrefs

Cf. A279673, A279674, A279682, A279684.

Sequence in context: A166536 A128720 A096745 * A027088 A027102 A218207

Adjacent sequences: A293946 A293947 A293948 * A293950 A293951 A293952

Keyword

nonn

Author

N. J. A. Sloane, Oct 28 2017

Extensions

a(8)-a(32) from Robert Price, Nov 30 2017

Status

approved