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.

A196941 a(n) is the minimum prime (or 1) needed to write integer n into the form n = a + b such that all prime factors of a and b are smaller or equal to a(n).

Table of values

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

List of values

[1, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 3, 3, 2, 2, 2, 3, 2, 3, 3, 5, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 5, 5, 2, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 2, 2, 2, 3, 2, 5, 3, 7, 2, 3, 3, 3, 3, 5, 3, 5, 2, 3, 3, 3, 3, 3, 3, 3, 3]