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 A335352 #5 Jun 04 2020 08:08:25 %S A335352 5,24,28,80,100,168,188,288,324,440,452,624,676,808,872,1088,1156, %T A335352 1368,1412,1644,1764,2024,2084,2380,2500,2808,2848,3248,3340,3720, %U A335352 3836,4188,4356,4744,4800,5328,5476,5896,5984,6560,6684,7224,7348,7852,8100,8648 %N 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. %C A335352 For n>1, a(n) is divisible by 4. %C A335352 See A335350 for illustrations. %H A335352 Lars Blomberg, <a href="/A335352/b335352.txt">Table of n, a(n) for n = 1..500</a> %Y A335352 Cf. A335350 (regions), A335351 (edges), A335353 (n-gons), A335354 (edges in central polygon), A255011, A335057, A335192. %K A335352 nonn %O A335352 1,1 %A A335352 _Lars Blomberg_, Jun 04 2020