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.

A161638 The largest number of steps in Euclid's algorithm applied to A157807(n) and A157813(n).

Table of values

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

List of values

[1, 1, 2, 2, 1, 1, 2, 3, 2, 2, 1, 1, 2, 2, 3, 3, 2, 2, 4, 3, 1, 1, 2, 2, 3, 3, 2, 2, 3, 2, 1, 1, 2, 3, 3, 2, 3, 4, 4, 3, 2, 2, 4, 3, 1, 1, 2, 2, 2, 4, 2, 3, 5, 3, 3, 3, 2, 2, 4, 4, 3, 3, 1, 1, 2, 3, 2, 3, 4, 3, 2, 2, 3, 3, 4, 3, 2, 2, 1, 1, 2, 3, 2, 3, 3, 3, 2]

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

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