|
|
A249133
|
|
Triangle read by rows: interleaving successive pairs of rows of Sierpiński's triangle.
|
|
7
|
|
|
1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
A105321(n) = number of ones in row n;
A249304(n) = number of zeros in row n;
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
. 0: 1
. 1: 1 1 1
. 2: 1 1 0 1 1
. 3: 1 1 1 0 1 1 1
. 4: 1 1 0 1 0 1 0 1 1
. 5: 1 1 1 0 0 0 0 0 1 1 1
. 6: 1 1 0 1 1 0 0 0 1 1 0 1 1
. 7: 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1
. 8: 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 1
. 9: 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1
. 10: 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1
. 11: 1 1 1 0 1 1 1 0 0 0 0 0 0 0 0 0 1 1 1 0 1 1 1
. 12: 1 1 0 1 0 1 0 1 1 0 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1
. 13: 1 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 1 1 1
. 14: 1 1 0 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1
. 15: 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1
. 16: 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 1 .
|
|
MATHEMATICA
|
row[n_] := Mod[Riffle[Binomial[n, Range[0, n]], Binomial[n - 1, Range[0, n - 1]]], 2]; Table[row[n], {n, 0, 10}] // Flatten (* Amiram Eldar, Jul 28 2023 *)
|
|
PROG
|
(Haskell)
a249133 n k = a249133_tabf !! n !! k
a249133_row n = a249133_tabf !! n
a249133_tabf = map (map (flip mod 2)) a249095_tabf
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|