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.

A368698 a(n) is the smallest positive k such that A005940(1+n) divides the oblong number k*(k+1).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 2
6 8
7 7
8 6
9 4
10 5
11 3
12 24
13 8
14 26
15 15
16 10
17 6
18 6
19 4
20 14
21 5
22 9
23 8
24 48
25 24
26 24
27 8
28 124
29 26
30 80
31 31
32 12
33 10
34 11
35 7
36 10
37 6
38 27
39 15
40 21
41 14
42 14
43 15
44 49
45 9
46 54
47 15
48 120
49 48
50 48
51 24
52 49
53 24
54 99
55 8
56 342
57 124
58 125
59 27
60 624
61 80
62 242
63 63
64 16
65 12
66 12
67 11
68 25
69 11
70 44
71 7
72 13
73 10
74 44
75 20
76 99
77 27
78 27
79 15
80 65
81 21
82 21
83 20

List of values

[1, 1, 2, 3, 4, 2, 8, 7, 6, 4, 5, 3, 24, 8, 26, 15, 10, 6, 6, 4, 14, 5, 9, 8, 48, 24, 24, 8, 124, 26, 80, 31, 12, 10, 11, 7, 10, 6, 27, 15, 21, 14, 14, 15, 49, 9, 54, 15, 120, 48, 48, 24, 49, 24, 99, 8, 342, 124, 125, 27, 624, 80, 242, 63, 16, 12, 12, 11, 25, 11, 44, 7, 13, 10, 44, 20, 99, 27, 27, 15, 65, 21, 21, 20]