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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A335352 a(n) is the number of vertices formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n. 5
5, 24, 28, 80, 100, 168, 188, 288, 324, 440, 452, 624, 676, 808, 872, 1088, 1156, 1368, 1412, 1644, 1764, 2024, 2084, 2380, 2500, 2808, 2848, 3248, 3340, 3720, 3836, 4188, 4356, 4744, 4800, 5328, 5476, 5896, 5984, 6560, 6684, 7224, 7348, 7852, 8100, 8648 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

For n>1, a(n) is divisible by 4.

See A335350 for illustrations.

LINKS

Lars Blomberg, Table of n, a(n) for n = 1..500

CROSSREFS

Cf. A335350 (regions), A335351 (edges), A335353 (n-gons), A335354 (edges in central polygon), A255011, A335057, A335192.

Sequence in context: A305057 A333633 A222355 * A056234 A030766 A063143

Adjacent sequences:  A335349 A335350 A335351 * A335353 A335354 A335355

KEYWORD

nonn

AUTHOR

Lars Blomberg, Jun 04 2020

STATUS

approved

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 November 26 11:47 EST 2022. Contains 358359 sequences. (Running on oeis4.)