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.

A214961 a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a triangular number.

Table of values

n a(n)
0 1
1 1
2 3
3 6
4 7
5 11
6 13
7 21
8 25
9 30
10 49
11 59
12 97
13 117
14 193
15 233
16 385
17 465
18 492
19 596
20 983
21 1191
22 1965
23 2381
24 2516
25 4761
26 5031
27 5761
28 6290
29 8466
30 9795
31 15470
32 15867
33 17403
34 20559
35 24170
36 26945
37 27192
38 27755
39 30130
40 35235
41 43537
42 45100
43 56805
44 58717
45 58739
46 91000
47 117477

List of values

[1, 1, 3, 6, 7, 11, 13, 21, 25, 30, 49, 59, 97, 117, 193, 233, 385, 465, 492, 596, 983, 1191, 1965, 2381, 2516, 4761, 5031, 5761, 6290, 8466, 9795, 15470, 15867, 17403, 20559, 24170, 26945, 27192, 27755, 30130, 35235, 43537, 45100, 56805, 58717, 58739, 91000, 117477]