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.

A205000 Least k such that n divides s(k)-s(j) for some j satisfying 1<=j where s(j)=3^j-2^j.

Table of values

n a(n)
1 2
2 2
3 3
4 2
5 4
6 3
7 3
8 4
9 3
10 4
11 6
12 4
13 7
14 3
15 4
16 4
17 6
18 3
19 6
20 4
21 5
22 6
23 4
24 5
25 6
26 7
27 9
28 7
29 13
30 4
31 9
32 4
33 6
34 6
35 5
36 8
37 9
38 6
39 8
40 6
41 7
42 5
43 12
44 6
45 8
46 4
47 8
48 5
49 7
50 6
51 7
52 8
53 16
54 9
55 6
56 7
57 9
58 13
59 13
60 4

List of values

[2, 2, 3, 2, 4, 3, 3, 4, 3, 4, 6, 4, 7, 3, 4, 4, 6, 3, 6, 4, 5, 6, 4, 5, 6, 7, 9, 7, 13, 4, 9, 4, 6, 6, 5, 8, 9, 6, 8, 6, 7, 5, 12, 6, 8, 4, 8, 5, 7, 6, 7, 8, 16, 9, 6, 7, 9, 13, 13, 4]