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.

A344005 a(n) = smallest positive m such that n divides the oblong number m*(m+1).

Table of values

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

List of values

[1, 1, 2, 3, 4, 2, 6, 7, 8, 4, 10, 3, 12, 6, 5, 15, 16, 8, 18, 4, 6, 10, 22, 8, 24, 12, 26, 7, 28, 5, 30, 31, 11, 16, 14, 8, 36, 18, 12, 15, 40, 6, 42, 11, 9, 22, 46, 15, 48, 24, 17, 12, 52, 26, 10, 7, 18, 28, 58, 15, 60, 30, 27, 63, 25, 11, 66, 16, 23, 14, 70, 8, 72, 36, 24, 19, 21]