A360298 - cp's OEIS frontend

A360298 Irregular triangle (an infinite binary tree) read by rows. The tree has root node 1 in row n = 1. For n > 1, each node with value m in row n-1 has a left child with value m / n if n divides m, and a right child with value m * n.

n	a(n)
1	1
2	2
3	6
4	24
5	120
6	20
7	720
8	140
9	5040
10	1120
11	630
12	40320
13	10080
14	70
15	5670
16	4480
17	362880
18	1008
19	100800
20	7
21	700
22	567
23	56700
24	448
25	44800
26	36288
27	3628800
28	11088
29	1108800
30	77
31	7700
32	6237
33	623700
34	4928
35	492800
36	399168
37	39916800
38	924
39	133056
40	92400
41	13305600
42	924
43	92400
44	74844
45	51975
46	7484400
47	59136
48	5913600
49	33264
50	4790016
51	3326400
52	479001600

[1, 2, 6, 24, 120, 20, 720, 140, 5040, 1120, 630, 40320, 10080, 70, 5670, 4480, 362880, 1008, 100800, 7, 700, 567, 56700, 448, 44800, 36288, 3628800, 11088, 1108800, 77, 7700, 6237, 623700, 4928, 492800, 399168, 39916800, 924, 133056, 92400, 13305600, 924, 92400, 74844, 51975, 7484400, 59136, 5913600, 33264, 4790016, 3326400, 479001600]

cp's OEIS Frontend

A360298 Irregular triangle (an infinite binary tree) read by rows. The tree has root node 1 in row n = 1. For n > 1, each node with value m in row n-1 has a left child with value m / n if n divides m, and a right child with value m * n.

Table of values

List of values