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.

A226046 Number of daughters to wait before picking in sultan's dowry problem with an unknown number of daughters between 1 and n with equal probability.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A054404.

Programs

  • Mathematica
    PR[n_, r_] := Sum[r/((k - 1)i n), {i, 1, n}, {k, r + 1, i}]; maxi[li_] := {Do[If[li[[n + 1]] < li[[n]], aux = n; Break[]], {n, 1, Length[li] - 1}], aux}[[2]]; SEQ[1] = 0; SEQ[2] = 1; SEQ[n_] := maxi[Table[PR[n, i], {i, 1, n - 1}]]; Table[SEQ[n], {n, 1, 133}]