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 A325302 #14 Dec 31 2020 11:11:15 %S A325302 8,14,23,33,41,55,63,77,91,108,116,134,142,158,180,202,210,232,240 %N A325302 a(n) is the number of vertices of the stepped pyramid with n levels described in A245092. %C A325302 To calculate a(n) consider that levels greater than n do not exist. %H A325302 Omar E. Pol, <a href="http://www.polprimos.com/imagenespub/polpyr05.jpg">Perspective view of the pyramid (first 16 levels)</a> %F A325302 a(n) = A325301(n) - A325300(n) + 2 (Euler's formula). %e A325302 For n = 1 the first level of the stepped pyramid (starting from the top) is a cube, and a cube has 8 vertices, so a(1) = 8. %Y A325302 Cf. A325300 (number of faces), A325301 (number of edges). %Y A325302 Cf. A196020, A235791, A236104, A237270, A237271, A237591, A237593, A245092, A262626, A294723, A323648. %K A325302 nonn,more %O A325302 1,1 %A A325302 _Omar E. Pol_, Apr 16 2019