login
The OEIS is supported by the many generous donors to the OEIS 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
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).
Sequence in context: A001049 A134445 A100508 * A053668 A218145 A250098
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 22:02 EDT 2024. Contains 371767 sequences. (Running on oeis4.)