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.

A205109 The number s(j) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists, and s(j)=3^j-2^j.

Table of values

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

List of values

[1, 1, 1, 1, 5, 1, 5, 1, 1, 5, 5, 5, 5, 5, 5, 1, 19, 1, 19, 5, 1, 5, 19, 19, 65, 5, 1, 211, 5, 5, 2059, 1, 5, 19, 1, 5, 5, 19, 65, 65, 665, 1, 19171, 5, 5, 19, 665, 19, 1, 65, 19, 65, 175099, 1, 5, 211, 19, 5, 211, 5]