A214963 - cp's OEIS frontend

A214963 a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is an oblong number.

n	a(n)
0	1
1	1
2	2
3	6
4	10
5	12
6	21
7	35
8	36
9	70
10	112
11	117
12	230
13	368
14	390
15	759
16	763
17	1290
18	2244
19	2292
20	3133
21	3580
22	4170
23	5154
24	5355
25	7014
26	7710
27	9160
28	9328
29	11592
30	19274
31	22616
32	27555
33	37290
34	37312
35	40756
36	47820
37	63680
38	68862
39	87450
40	93730
41	108985
42	110262
43	132888
44	137731
45	159159

[1, 1, 2, 6, 10, 12, 21, 35, 36, 70, 112, 117, 230, 368, 390, 759, 763, 1290, 2244, 2292, 3133, 3580, 4170, 5154, 5355, 7014, 7710, 9160, 9328, 11592, 19274, 22616, 27555, 37290, 37312, 40756, 47820, 63680, 68862, 87450, 93730, 108985, 110262, 132888, 137731, 159159]

cp's OEIS Frontend

A214963 a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is an oblong number.

Table of values

List of values