The number of imperfect staircase polygons counted by diagonal length (also the distance of the terminal vertex from the origin).
A173409
The number of imperfect staircase polygons counted by diagonal length (also the distance of the terminal vertex from the origin).
Terms
- a(0) =1a(1) =7a(2) =41a(3) =233a(4) =1357a(5) =8382a(6) =56241a(7) =414991a(8) =3365633a(9) =29693227a(10) =280911761a(11) =2810638235a(12) =29409100985a(13) =319090781677
External references
- oeis: A173409