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.
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.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =24a(4) =120a(5) =20a(6) =720a(7) =140a(8) =5040a(9) =1120a(10) =630a(11) =40320a(12) =10080a(13) =70a(14) =5670a(15) =4480a(16) =362880a(17) =1008a(18) =100800a(19) =7a(20) =700a(21) =567a(22) =56700a(23) =448a(24) =44800a(25) =36288a(26) =3628800a(27) =11088a(28) =1108800a(29) =77
External references
- oeis: A360298