Maximal number of 3-tree rows in n-tree orchard problem.
A003035
Maximal number of 3-tree rows in n-tree orchard problem.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =1a(4) =2a(5) =4a(6) =6a(7) =7a(8) =10a(9) =12a(10) =16a(11) =19a(12) =22a(13) =26
External references
- oeis: A003035