login
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
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
KEYWORD
nonn,tabl,nice
AUTHOR
Ivan Neretin, Mar 14 2017
STATUS
approved