|
| |
|
|
A103842
|
|
Triangle read by rows: row n is binary expansion of 2^n-n, n >= 1.
|
|
1
| |
|
|
1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| This sequence can also be obtained by reading (from bottom to top, column by column) the array given in A103582 after suppressing the terms below the main diagonal.
|
|
|
REFERENCES
| David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
|
|
|
LINKS
| David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
|
|
|
EXAMPLE
| Table begins:
1
1 0
1 0 1
1 1 0 0
1 1 0 1 1
1 1 1 0 1 0
1 1 1 1 0 0 1
|
|
|
MAPLE
| p:=proc(n) local A, j, b: A:=convert(2^n-n, base, 2): for j from 1 to nops(A) do b:=j->A[nops(A)+1-j] od: seq(b(j), j=1..nops(A)): end: for n from 1 to 15 do p(n) od; # yields sequence in triangular form (Deutsch)
|
|
|
CROSSREFS
| Cf. A000325, A103582.
Sequence in context: A108336 A118268 A143220 * A065535 A093719 A153778
Adjacent sequences: A103839 A103840 A103841 * A103843 A103844 A103845
|
|
|
KEYWORD
| nonn,tabl,easy
|
|
|
AUTHOR
| Phillipe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 31 2005
|
|
|
EXTENSIONS
| More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 16 2005
|
| |
|
|
