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.

A056053 a(n) = smallest odd number 2m+1 such that the partial sum of the odd harmonic series Sum_{j=0..m} 1/(2j+1) is > n.

Table of values

n a(n)
0 1
1 3
2 15
3 113
4 837
5 6183
6 45691
7 337607
8 2494595
9 18432707
10 136200301
11 1006391657
12 7436284415
13 54947122715
14 406007372211
15 3000011249847
16 22167251422541
17 163795064320249
18 1210290918990281
19 8942907496445513
20 66079645178783351
21 488266205223462461
22 3607826381608149807

List of values

[1, 3, 15, 113, 837, 6183, 45691, 337607, 2494595, 18432707, 136200301, 1006391657, 7436284415, 54947122715, 406007372211, 3000011249847, 22167251422541, 163795064320249, 1210290918990281, 8942907496445513, 66079645178783351, 488266205223462461, 3607826381608149807]