A325302 a(n) is the number of vertices of the stepped pyramid with n levels described in A245092.

8, 14, 23, 33, 41, 55, 63, 77, 91, 108, 116, 134, 142, 158, 180, 202, 210, 232, 240

Offset: 1

Author

Omar E. Pol, Apr 16 2019

Keywords

• nonn
• more

Comments

To calculate a(n) consider that levels greater than n do not exist.

Examples

			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.
		

Links

• Omar E. Pol, Perspective view of the pyramid (first 16 levels)

Crossrefs

Cf. A325300 (number of faces), A325301 (number of edges).

Cf. A196020, A235791, A236104, A237270, A237271, A237591, A237593, A245092, A262626, A294723, A323648.

Formula

a(n) = A325301(n) - A325300(n) + 2 (Euler's formula).