Number of edges 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.
A369177
Number of edges 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) =6a(1) =24a(2) =66a(3) =152a(4) =318a(5) =576a(6) =998a(7) =1608a(8) =2474a(9) =3600a(10) =5162a(11) =7100a(12) =9670a(13) =12772a(14) =16546a(15) =21036a(16) =26622a(17) =33024a(18) =40814a(19) =49716a(20) =60006a(21) =71560a(22) =85158a(23) =100264a(24) =117626a(25) =136780a(26) =158358a(27) =182080a(28) =209106a(29) =238312
External references
- oeis: A369177