Smallest number whose representation requires n triangular numbers with greedy algorithm; also number of 1-2 rooted trees of height n.
A006893
Smallest number whose representation requires n triangular numbers with greedy algorithm; also number of 1-2 rooted trees of height n.
Terms
- a(0) =1a(1) =2a(2) =5a(3) =20a(4) =230a(5) =26795a(6) =359026205
External references
- oeis: A006893