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.

A383228 a(n) is the number of cases where both j and k (1 <= j < k <= n), are divisors of Sum_{i=j..k} i^i.

Table of values

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

List of values

[0, 0, 0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17]