Number of triangles in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).
A332606
Number of triangles in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).
Terms
- a(0) =14a(1) =48a(2) =102a(3) =192a(4) =326a(5) =524a(6) =802a(7) =1192a(8) =1634a(9) =2296a(10) =3074a(11) =4052a(12) =5246a(13) =6740a(14) =8398a(15) =10440a(16) =12770a(17) =15512a(18) =18782a(19) =22384a(20) =26386a(21) =31204a(22) =36482a(23) =42232a(24) =48826a(25) =56508a(26) =64318a(27) =73356a(28) =83366a(29) =93996
External references
- oeis: A332606