cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A293949 Arises in a coin-weighing problem.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Oct 28 2017

Keywords

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

Crossrefs

Extensions

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