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.

A294280 a(n) = least positive k such that omega(n+k) > max(omega(n), omega(k)), where omega(m) = A001221(m), the number of distinct primes dividing m.

Table of values

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

List of values

[1, 4, 3, 2, 1, 24, 3, 2, 1, 20, 1, 18, 1, 16, 15, 2, 1, 12, 1, 10, 9, 8, 1, 6, 1, 4, 1, 2, 1, 180, 2, 1, 9, 8, 7, 6, 1, 4, 3, 2, 1, 168, 1, 16, 15, 14, 1, 12, 1, 10, 9, 8, 1, 6, 5, 4, 3, 2, 1, 150, 1, 4, 3, 1, 1, 144, 1, 2, 1, 140, 1, 6, 1, 4, 3, 2, 1, 132, 1]