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.

A205372 Least s(k) such that n divides s(k)-s(j) for some j where s=A024675.

Table of values

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

List of values

[6, 6, 9, 12, 9, 12, 18, 12, 15, 26, 15, 18, 30, 18, 21, 34, 21, 30, 34, 26, 30, 26, 50, 30, 34, 30, 39, 34, 50, 34, 76, 50, 39, 60, 39, 42, 76, 42, 45, 86, 45, 60, 64, 50, 60, 50, 56, 60, 64, 56, 60, 56, 129, 60, 64, 60, 69, 64, 93, 64, 76, 134, 69, 76, 69, 72, 76]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.