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!)
A130832 Number of cubes in Menger cube constructions by levels: Sum[20^(2^n), {n, 0, m}]. 0
20, 420, 160420, 25600160420, 655360000025600160420, 429496729600000000000655360000025600160420 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A Sierpinski gasket has three starting states: a Sierpinski carpet has eight starting states: A Sierpinski tetrahedron has four starting states: the Menger cube has 27-7=20 starting states. This fact makes making a level four or level five Menger construction a very difficult task.
LINKS
FORMULA
a(m) = Sum[20^(2^n), {n, 0, m}]
MATHEMATICA
f[m_] := Sum[20^(2^n), {n, 0, m}] Table[f[n], {n, 0, 5}]
CROSSREFS
Sequence in context: A268738 A358108 A215290 * A180810 A109116 A190922
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Aug 20 2007
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 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)