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.

A205108 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=3^j-2^j.

Table of values

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

List of values

[5, 5, 19, 5, 65, 19, 19, 65, 19, 65, 665, 65, 2059, 19, 65, 65, 665, 19, 665, 65, 211, 665, 65, 211, 665, 2059, 19171, 2059, 1586131, 65, 19171, 65, 665, 665, 211, 6305, 19171, 665, 6305, 665, 2059, 211, 527345, 665, 6305, 65, 6305, 211, 2059, 665]