|
Search: id:A153490
|
|
|
| A153490 |
|
Anti-diagonal of Sierpinski carpet binary square matrix as a triangular sequence; (uses MathWorld definition program). |
|
+0
1
|
|
| 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Row sums are:
{1, 2, 2, 4, 5, 4, 6, 6, 4, 8, 10, 8,...}.
|
|
REFERENCES
|
Weisstein, Eric W. "Sierpinski Carpet." http://mathworld.wolfram.com/SierpinskiCarpet.html
|
|
EXAMPLE
|
{1},
{1, 1},
{1, 0, 1},
{1, 1, 1, 1},
{1, 1, 1, 1, 1},
{1, 0, 1, 1, 0, 1},
{1, 1, 1, 0, 1, 1, 1},
{1, 1, 1, 0, 0, 1, 1, 1},
{1, 0, 1, 0, 0, 0, 1, 0, 1},
{1, 1, 1, 1, 0, 0, 1, 1, 1, 1},
{1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1},
{1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1}
|
|
MATHEMATICA
|
<< MathWorld`Fractal`; fractal = SierpinskiCarpet;
a = fractal[4]; Table[Table[a[[m]][[n - m + 1]], {m, 1, n}], {n, 1, 12}];
Flatten[%]
|
|
CROSSREFS
|
Sequence in context: A089939 A059095 A105597 this_sequence A014194 A014379 A014164
Adjacent sequences: A153487 A153488 A153489 this_sequence A153491 A153492 A153493
|
|
KEYWORD
|
nonn,uned,tabl
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 27 2008
|
|
|
Search completed in 0.002 seconds
|
