Triangle read by columns: number of n-node (unlabeled) graphs with girth k, for n >= 3, k >= 3.

Terms

a(0) =1a(1) =4a(2) =1a(3) =20a(4) =3a(5) =1a(6) =118a(7) =15a(8) =2a(9) =1a(10) =937a(11) =59a(12) =8a(13) =2a(14) =1a(15) =11936a(16) =296a(17) =26a(18) =9a(19) =2a(20) =1a(21) =272771a(22) =1604a(23) =101a(24) =28a(25) =8a(26) =2a(27) =1a(28) =11992996a(29) =11303