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.

A226033 Round(n * exp(-1 - 1/(2n))), an approximation to the number of daughters to wait before picking in the sultan's dowry problem (Better that A225593).

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 2
6 2
7 2
8 3
9 3
10 3
11 4
12 4
13 5
14 5
15 5
16 6
17 6
18 6
19 7
20 7
21 8
22 8
23 8
24 9
25 9
26 9
27 10
28 10
29 10
30 11
31 11
32 12
33 12
34 12
35 13
36 13
37 13
38 14
39 14
40 15
41 15
42 15
43 16
44 16
45 16
46 17
47 17
48 17
49 18
50 18
51 19
52 19
53 19
54 20
55 20
56 20
57 21
58 21
59 22
60 22
61 22
62 23
63 23
64 23
65 24
66 24
67 24
68 25
69 25
70 26
71 26
72 26

List of values

[0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 19, 19, 19, 20, 20, 20, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 25, 25, 26, 26, 26]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.