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.

A094756 a(n) = least k>1 such that (1+2+3+...+k) divides (1^n + 2^n + 3^n + ... + k^n).

Table of values

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

List of values

[2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 16, 2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 16, 2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 16, 2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 22, 2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 16, 2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 16, 2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 16, 2, 4, 2, 7, 2, 4, 2, 7, 2, 4, 2, 22, 2, 4, 2, 7, 2, 4]