login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325302 a(n) is the number of vertices of the stepped pyramid with n levels described in A245092. 3
8, 14, 23, 33, 41, 55, 63, 77, 91, 108, 116, 134, 142, 158, 180, 202, 210, 232, 240 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Table of n, a(n) for n=1..19.

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

FORMULA

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

EXAMPLE

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.

CROSSREFS

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

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

Sequence in context: A001049 A134445 A100508 * A053668 A218145 A250098

Adjacent sequences:  A325299 A325300 A325301 * A325303 A325304 A325305

KEYWORD

nonn,more

AUTHOR

Omar E. Pol, Apr 16 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 04:10 EDT 2021. Contains 347596 sequences. (Running on oeis4.)