login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) is the number of vertices formed by n-secting the angles of a pentagon.
4

%I #8 Jun 20 2020 14:13:00

%S 5,11,10,46,135,71,280,266,325,456,710,506,985,981,1085,1291,1725,

%T 1091,2140,2121,2310,2586,3180,2706,3750,3726,3955,4341,5090,4436,

%U 5825,5761,6060,6531,7455,6241,8290,8276,8620,9146,10270,9326,11245,11206,11615,12241

%N a(n) is the number of vertices formed by n-secting the angles of a pentagon.

%C See A335553 for illustrations.

%H Lars Blomberg, <a href="/A335554/b335554.txt">Table of n, a(n) for n = 1..200</a>

%Y Cf. A330847 (n-sected sides, not angles), A335553 (regions), A335555 (edges), A335556 (ngons).

%K nonn

%O 1,1

%A _Lars Blomberg_, Jun 20 2020