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.

A297934 Triangular array T(n, k), read by rows: least common prime factor of n and k, or 0 if n and k are coprime.

Table of values

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

List of values

[0, 2, 0, 0, 0, 0, 2, 3, 2, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 2, 0, 0, 3, 0, 0, 3, 0, 0, 2, 0, 2, 5, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 2, 0, 2, 0, 2, 3, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 2, 7, 2, 0, 2, 0, 2, 0, 0, 3, 0, 5, 3, 0, 0, 3, 5]

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

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