login
A195916
Table with T(n,n) = n, T(n,k) = xor(T(n-1,k-1), T(n-1,k))
1
1, 1, 2, 1, 3, 3, 1, 2, 0, 4, 1, 3, 2, 4, 5, 1, 2, 1, 6, 1, 6, 1, 3, 3, 7, 7, 7, 7, 1, 2, 0, 4, 0, 0, 0, 8, 1, 3, 2, 4, 4, 0, 0, 8, 9, 1, 2, 1, 6, 0, 4, 0, 8, 1, 10, 1, 3, 3, 7, 6, 4, 4, 8, 9, 11, 11, 1, 2, 0, 4, 1, 2, 0, 12, 1, 2, 0, 12
OFFSET
1,3
COMMENTS
We take T(n,0) = 0 for the calculation.
Every column is periodic. It appears that, if 2^j > k, column k has period 2^j. If so, then for j >= i, T(2^j,2^i) = 2^i and T(2^j,k) = 0 if k is not a power of 2.
EXAMPLE
The table starts:
1
1, 2
1, 3, 3
1, 2, 0, 4
1, 3, 2, 4, 5
1, 2, 1, 6, 1, 6
1, 3, 3, 7, 7, 7, 7
PROG
(PARI) anrow(n)=local(r, v); r=v=[1]; for(k=2, n, v=vector(#v+1, j, if(j==k, k, bitxor(v[j], if(j==1, 0, v[j-1])))); r=concat(r, v)); r
CROSSREFS
Row reversals of A195915. For xor see A003987.
Sequence in context: A374630 A158440 A119803 * A245554 A110569 A140815
KEYWORD
nonn,easy,tabl
AUTHOR
STATUS
approved