|
Search: id:A106465
|
|
|
| A106465 |
|
A number triangle of gcd's mod 2. |
|
+0
6
|
|
| 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Rows alternate between all 1's and alternating 1's and 0's. A 'mixed' sequence array : rows alternate between the rows of the sequence array for the all 1's sequence and the sequence array for the sequence 1,0,1,0,.. Column 2k has g.f. x^2k/(1-x); column 2k+1 has g.f. x^(2k+1)/(1-x^2). Row sums are A029578(n+2). Diagonal sums are A106466.
|
|
FORMULA
|
Number triangle T(n, k)=mod(if(k<=n, gcd(n-k+1, k+1), 0), 2); A106465=mod(A003989, 2).
|
|
EXAMPLE
|
Triangle begins
1;
1,1;
1,0,1;
1,1,1,1;
1,0,1,0,1;
1,1,1,1,1,1;
|
|
CROSSREFS
|
Adjacent sequences: A106462 A106463 A106464 this_sequence A106466 A106467 A106468
Sequence in context: A047999 A054431 A106470 this_sequence A099990 A089939 A059095
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), May 03 2005
|
|
|
Search completed in 0.002 seconds
|
