This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A335556 #10 Jun 20 2020 13:32:18 %S A335556 0,0,1,10,10,0,1,50,10,50,60,15,5,0,0,0,1,60,30,110,125,30,0,0,5,5,1, %T A335556 150,140,20,150,90,70,10,5,0,0,1,240,200,60,10,230,355,75,40,0,5,0,1, %U A335556 300,190,80,10,360,400,175,25,10,10,0,1,460,430,150,30 %N A335556 Irregular table read by rows: n-sect the angles of a pentagon. Then T(n,k) is the number of k-sided polygons in that figure for k >= 3. %C A335556 See A335553 for illustrations. %C A335556 For n<=200 no polygon has more than 10 edges. %H A335556 Lars Blomberg, <a href="/A335556/b335556.txt">Table of n, a(n) for n = 1..1351</a> (the first 200 rows) %e A335556 The table begins %e A335556 0, 0, 1; %e A335556 10; %e A335556 10, 0, 1; %e A335556 50, 10; %e A335556 50, 60, 15, 5, 0, 0, 0, 1; %e A335556 60, 30; %e A335556 110, 125, 30, 0, 0, 5, 5, 1; %e A335556 150, 140, 20; %e A335556 150, 90, 70, 10, 5, 0, 0, 1; %e A335556 240, 200, 60, 10; %e A335556 230, 355, 75, 40, 0, 5, 0, 1; %e A335556 300, 190, 80, 10; %e A335556 360, 400, 175, 25, 10, 10, 0, 1; %e A335556 460, 430, 150, 30; %Y A335556 Cf. A331939 (n-sected sides, not angles), A335553 (regions), A335554 (vertices), A335555 (edges). %K A335556 nonn,tabf %O A335556 1,4 %A A335556 _Lars Blomberg_, Jun 20 2020