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.

A374369 Triangle T(n, k), n > 0, k = 0..n-1, read by rows; T(n, k) is the least m such that n and k differ modulo m.

Table of values

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

List of values

[2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 2, 4, 2, 3, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 2, 3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 2, 5, 2, 3, 2, 3, 2, 4, 2, 3, 2, 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.