Number of vertices in a graph of n adjacent rectangles in a row with all possible diagonals drawn, as in A306302, but without the rectangles' edges which are perpendicular to the row.
A369176
Number of vertices in a graph of n adjacent rectangles in a row with all possible diagonals drawn, as in A306302, but without the rectangles' edges which are perpendicular to the row.
Terms
- a(0) =5a(1) =13a(2) =31a(3) =67a(4) =139a(5) =247a(6) =429a(7) =691a(8) =1067a(9) =1543a(10) =2217a(11) =3047a(12) =4169a(13) =5495a(14) =7117a(15) =9031a(16) =11449a(17) =14179a(18) =17547a(19) =21379a(20) =25835a(21) =30755a(22) =36613a(23) =43091a(24) =50605a(25) =58775a(26) =68035a(27) =78171a(28) =89831a(29) =102335
External references
- oeis: A369176