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.

A227689 a(n) is the least integer k such that 2^k - 1 has at least 10^n digits.

Table of values

n a(n)
0 1
1 30
2 329
3 3319
4 33216
5 332190
6 3321925
7 33219278
8 332192807
9 3321928092
10 33219280946
11 332192809486
12 3321928094885
13 33219280948871
14 332192809488733
15 3321928094887360
16 33219280948873621
17 332192809488736232
18 3321928094887362345
19 33219280948873623476

List of values

[1, 30, 329, 3319, 33216, 332190, 3321925, 33219278, 332192807, 3321928092, 33219280946, 332192809486, 3321928094885, 33219280948871, 332192809488733, 3321928094887360, 33219280948873621, 332192809488736232, 3321928094887362345, 33219280948873623476]