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.

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

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)

Clark Kimberling, Fractal sequences

Clark Kimberling, Numeration systems and fractal sequences, Acta Arithmetica 73 (1995) 103-117.

Formula

a(n) = A020906(n) - 1. The positions of ones here (2, 5, 9, 11, 14, 17, ...) are given by A020907.- Georg Fischer, Jul 28 2023

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. A020906, A020907, 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