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.

A378914 Smallest positive m such that sigma(m) does not divide n, where sigma is the sum-of-divisors function (A000203).

Table of values

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

List of values

[2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 7, 2, 2, 3, 2, 2, 3]