|
| |
|
|
A283683
|
|
Unique sequence with a(1)=0, a(2)=1, representing an array T(i,j) read by antidiagonals in which every row is this sequence itself.
|
|
6
|
|
|
|
0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1
|
|
|
COMMENTS
|
All terms are either 0 or 1. 1's are always isolated (i.e., never adjacent). There are arbitrarily long runs of consecutive 0's (see A283325).
|
|
|
LINKS
|
Ivan Neretin, Table of n, a(n) for n = 1..26796 (corrected by Ray Chandler, Jan 19 2019)
|
|
|
EXAMPLE
|
The sequence begins: 0, 1, 0, 0, 1, 0, 0, 0, 1, 0...
It represents a rectangular array read by downward antidiagonals. Each row of the array is this sequence itself:
0 1 0 0 1 0...
0 1 0 0 1...
0 1 0 0...
0 1 0...
0 1...
0...
...
|
|
|
MATHEMATICA
|
Nest[Flatten@Table[#[[n - i]], {n, Length[#] + 1}, {i, n - 1}] &, {0, 1}, 4]
|
|
|
CROSSREFS
|
Cf. A283681, A283682.
Sequence in context: A179828 A129184 A129185 * A118605 A175253 A163584
Adjacent sequences: A283680 A283681 A283682 * A283684 A283685 A283686
|
|
|
KEYWORD
|
nonn,tabl,nice
|
|
|
AUTHOR
|
Ivan Neretin, Mar 14 2017
|
|
|
STATUS
|
approved
|
| |
|
|
