login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A358409 Number of edges formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square. 2

%I #8 Nov 16 2022 08:53:27

%S 4,12,68,316,1020,2524,5420,10348,18044,29244,45940,66188,97796,

%T 135772,182532,240932,321612,405852,525184,646088,796388,974740,

%U 1199244,1407140,1700944,2004576,2356296,2729256,3221296,3630296,4272656,4835984,5522768,6269016,7084056,7835068,8987192,10005400

%N Number of edges formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square.

%C See A358407 and A358408 for images of the square.

%F a(n) = A358407(n) + A358408(n) - 1 by Euler's formula.

%Y Cf. A358407 (regions), A358408 (vertices), A355800, A331448.

%K nonn

%O 1,1

%A _Scott R. Shannon_, Nov 14 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 21:50 EDT 2024. Contains 374475 sequences. (Running on oeis4.)