a(n) is the number of distinct ways to cut an equilateral triangle with edges of size n into equilateral triangles with integer sides.

A358715

a(n) is the number of distinct ways to cut an equilateral triangle with edges of size n into equilateral triangles with integer sides.

Terms

    a(0) =1a(1) =2a(2) =5a(3) =26a(4) =220a(5) =3622a(6) =105859a(7) =5677789a(8) =553715341a(9) =98404068313

External references