login
a(n) is the number of edges formed by n-secting the angles of a nonagon (enneagon).
4

%I #9 Jun 24 2020 10:05:53

%S 9,36,261,279,783,846,288,1557,2583,2664,3897,3996,5661,2214,7407,

%T 7425,9603,9549,11997,12231,9738,14607,17667,17730,20781,20997,24669,

%U 16515,27873,28278,32301,32202,36657,36981,32706,40698,46161,46143,51039,51462,56979

%N a(n) is the number of edges formed by n-secting the angles of a nonagon (enneagon).

%C See A335781 for illustrations.

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

%Y Cf. A332429 (n-sected sides, not angles), A335781 (regions), A335782 (vertices), A335784 (ngons).

%K nonn

%O 1,1

%A _Lars Blomberg_, Jun 24 2020