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.

A374840 a(n) is the greatest m > 0 such that the n-th row of Pascal's triangle (A007318) contains a multiple of k for k = 1..m.

Table of values

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

List of values

[1, 1, 2, 1, 4, 2, 6, 1, 2, 4, 10, 3, 12, 6, 4, 1, 16, 2, 18, 4, 6, 10, 22, 3, 4, 12, 2, 6, 28, 15, 30, 1, 10, 16, 6, 8, 36, 18, 12, 7, 40, 6, 42, 10, 8, 22, 46, 3, 6, 4, 16, 12, 52, 2, 10, 7, 18, 28, 58, 15, 60, 30, 8, 1, 12, 10, 66, 16, 22, 24, 70, 8, 72, 36]