login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153490 Anti-diagonal of Sierpinski carpet binary square matrix as a triangular sequence; (uses MathWorld definition program). 0
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; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Row sums are:

{1, 2, 2, 4, 5, 4, 6, 6, 4, 8, 10, 8,...}.

LINKS

Table of n, a(n) for n=1..78.

Eric Weisstein's World of Mathematics, Sierpinski Carpet.

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: A059095 A105597 A071026 * A014194 A014379 A014164

Adjacent sequences:  A153487 A153488 A153489 * A153491 A153492 A153493

KEYWORD

nonn,uned,tabl

AUTHOR

Roger L. Bagula, Dec 27 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 19:05 EST 2016. Contains 278895 sequences.