|
Search: id:A104567
|
|
|
| A104567 |
|
Triangle read by rows: T(i,j)=i-j+1 if j is odd; T(i,j)=2(i-j+1) if j is even (1<=j<=i). |
|
+0
3
|
|
| 1, 2, 2, 3, 4, 1, 4, 6, 2, 2, 5, 8, 3, 4, 1, 6, 10, 4, 6, 2, 2, 7, 12, 5, 8, 3, 4, 1, 8, 14, 6, 10, 4, 6, 2, 2, 9, 16, 7, 12, 5, 8, 3, 4, 1, 10, 18, 8, 14, 6, 10, 4, 6, 2, 2, 11, 20, 9, 16, 7, 12, 5, 8, 3, 4, 1, 12, 22, 10, 18, 8, 14, 6, 10, 4, 6, 2, 2, 13, 24, 11, 20, 9, 16, 7, 12, 5, 8, 3, 4, 1, 14
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
T(i,j) is the (i,j)-entry (1<=j<=i) of the product R*H of the infinite lower triangular matrices R = [1; 1,1; 1,1,1; 1,1,1,1;...] and H = [1; 1,2; 1,2,1; 1 2,1,2;...]. Row sums yield A006578. H*R yields A104566. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 24 2005
|
|
FORMULA
|
T(i, j)=i-j+1 if j is odd; T(i, j)=2(i-j+1) if j is even (1<=j<=i). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 24 2005
|
|
EXAMPLE
|
The first few rows are:
1;
2, 2;
3, 4, 1;
4, 6, 2, 2
|
|
MAPLE
|
T:=proc(i, j) if j>i then 0 elif j mod 2 = 1 then i-j+1 elif j mod 2 = 0 then 2*(i-j+1) else fi end: for i from 1 to 14 do seq(T(i, j), j=1..i) od; # yields sequence in triangular form (Deutsch)
|
|
CROSSREFS
|
Cf. A104568, A006578, A001082, A104566.
Cf. A006578, A104566.
Sequence in context: A071507 A071509 A159804 this_sequence A087824 A008951 A119473
Adjacent sequences: A104564 A104565 A104566 this_sequence A104568 A104569 A104570
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 16 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 24 2005
|
|
|
Search completed in 0.002 seconds
|
