Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130832
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130832 Number of cubes in Menger cube constructions by levels: Sum[20^(2^n), {n, 0, m}]. +0
1
20, 420, 160420, 25600160420, 655360000025600160420, 429496729600000000000655360000025600160420 (list; graph; listen)
OFFSET

1,1

COMMENT

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.

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: A041181 A041762 A068772 this_sequence A109116 A136257 A099278

Adjacent sequences: A130829 A130830 A130831 this_sequence A130833 A130834 A130835

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Aug 20 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research