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.

A188224 For k > a(n), the maximum number of steps that the Euclidean algorithm requires for computing (k,i), with i < k, is greater than n.

Table of values

n a(n)
0 1
1 2
2 6
3 10
4 24
5 54
6 96
7 200
8 442
9 650
10 1548
11 2370
12 4060
13 7670
14 15792
15 25740
16 49074
17 81900
18 147756
19 251012

List of values

[1, 2, 6, 10, 24, 54, 96, 200, 442, 650, 1548, 2370, 4060, 7670, 15792, 25740, 49074, 81900, 147756, 251012]