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!)
A325300 a(n) is the number of faces of the stepped pyramid with n levels described in A245092. 4
6, 9, 15, 20, 24, 31, 35, 42, 49, 59, 63, 72, 76, 84, 95, 106, 110, 121, 125 (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.
The shape of the n-th level of the pyramid allows us to know if n is prime (see the Formula section).
For more information about the sequences that we can see in the pyramid see A262626.
LINKS
FORMULA
a(n) = A325301(n) - A325302(n) + 2 (Euler's formula).
a(n) = A323645(n) + 3.
a(n) = a(n-1) + 4 iff n is a prime > 3 (A215848).
EXAMPLE
For n = 1 the first level of the stepped pyramid (starting from the top) is a cube, and a cube has six faces, so a(1) = 6.
CROSSREFS
Cf. A325301 (number of edges), A325302 (number of vertices).
Sequence in context: A316035 A316036 A316037 * A316038 A316039 A316040
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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)