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.

A275479 Least positive k such that d(n) divides d(n+k) (d = A000005).

Table of values

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

List of values

[1, 1, 2, 5, 1, 2, 1, 2, 3, 4, 1, 6, 1, 1, 6, 32, 1, 2, 1, 8, 1, 2, 1, 6, 3, 1, 3, 4, 1, 10, 1, 12, 1, 1, 3, 64, 1, 1, 1, 2, 1, 12, 1, 1, 5, 5, 1, 32, 1, 2, 3, 8, 1, 2, 1, 10, 1, 2, 1, 12, 1, 3, 5, 128, 1, 4, 1, 4, 1, 8, 1, 12, 1, 3, 1, 8, 1, 10, 1, 32, 31, 2, 1, 6, 1, 1, 1, 14, 1, 6, 2, 4, 1, 1, 1, 12, 1, 1, 9, 80]