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.

A275478 Least k such that d(n) divides d(n+2^k) (d = A000005).

Table of values

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

List of values

[0, 0, 1, 3, 0, 1, 0, 1, 4, 2, 0, 3, 0, 0, 7, 5, 0, 1, 0, 3, 0, 1, 0, 4, 7, 0, 3, 2, 0, 8, 0, 6, 0, 0, 2, 6, 0, 0, 0, 1, 0, 7, 0, 0, 23, 3, 0, 5, 0, 1, 2, 3, 0, 1, 0, 5, 0, 1, 0, 9, 0, 2, 9, 7, 0, 2, 0, 2, 0, 3, 0, 7, 0, 2, 0, 3, 0, 5, 0, 5, 178, 1, 0, 8, 0, 0, 0, 4, 0, 24, 1, 2, 0, 0, 0, 6, 0, 0, 20, 9]