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.

A227054 a(n) = least triangular number t > 0 such that n*t is a triangular number, or 0 if no such t exists.

Table of values

n a(n)
1 1
2 3
3 1
4 0
5 3
6 1
7 3
8 15
9 0
10 1
11 6
12 3
13 6
14 15
15 1
16 0
17 78
18 21
19 10
20 6
21 1
22 3
23 45
24 190
25 0
26 3
27 55
28 1
29 15
30 10
31 15
32 28203
33 45
34 105
35 3
36 1
37 465
38 120
39 55
40 3
41 21
42 15
43 21
44 3570
45 1
46 6
47 210
48 861
49 0
50 6
51 3
52 15
53 105
54 21945
55 1
56 21
57 3
58 66
59 26565
60 91
61 276
62 378
63 6
64 0
65 1596
66 1
67 300

List of values

[1, 3, 1, 0, 3, 1, 3, 15, 0, 1, 6, 3, 6, 15, 1, 0, 78, 21, 10, 6, 1, 3, 45, 190, 0, 3, 55, 1, 15, 10, 15, 28203, 45, 105, 3, 1, 465, 120, 55, 3, 21, 15, 21, 3570, 1, 6, 210, 861, 0, 6, 3, 15, 105, 21945, 1, 21, 3, 66, 26565, 91, 276, 378, 6, 0, 1596, 1, 300]