cp's OEIS Frontend

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.

A335351 a(n) is the number of edges 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.

This page as a plain text file.
%I A335351 #5 Jun 04 2020 08:08:14
%S A335351 8,48,64,160,208,336,392,576,664,880,936,1248,1376,1632,1784,2176,
%T A335351 2344,2736,2872,3304,3568,4048,4224,4768,5048,5616,5776,6496,6744,
%U A335351 7440,7736,8392,8776,9496,9712,10656,11024,11808,12088,13120,13464,14448,14800,15736
%N A335351 a(n) is the number of edges 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 A335351 For n>1, a(n) is divisible by 8.
%C A335351 See A335350 for illustrations.
%H A335351 Lars Blomberg, <a href="/A335351/b335351.txt">Table of n, a(n) for n = 1..500</a>
%Y A335351 Cf. A335350 (regions), A335352 (vertices), A335353 (n-gons), A335354 (edges in central polygon), A255011, A335057, A335192.
%K A335351 nonn
%O A335351 1,1
%A A335351 _Lars Blomberg_, Jun 04 2020