The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101309 Matrix logarithm of A047999 (Pascal's triangle mod 2). 1
0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Row sums equal A000120 (binary 1's-counting sequence). Antidiagonal sums form A101979.
LINKS
FORMULA
T(n, k)=1 when n XOR k = 2^m for integer m>=0, T(n, k)=0 elsewhere.
EXAMPLE
T(n,k)=1 when n XOR k is a power of 2:
T(3,2)=1 since 3 XOR 2 = 2^0, T(4,0)=1 since 4 XOR 0 = 2^2,
T(5,1)=1 since 5 XOR 1 = 2^2, T(6,4)=1 since 6 XOR 4 = 2^2.
Rows begin:
[0],
[1, 0],
[1,0, 0],
[0,1, 1,0],
[1,0,0,0, 0],
[0,1,0,0, 1,0],
[0,0,1,0, 1,0,0],
[0,0,0,1, 0,1,1,0],...
PROG
(PARI) T(n, k)=if(n>k&bitxor(n, k)==2^valuation(bitxor(n, k), 2), 1, 0)
CROSSREFS
Sequence in context: A127266 A083923 A352824 * A141474 A073424 A135993
KEYWORD
nonn,tabl
AUTHOR
Paul D. Hanna, Dec 23 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 23:42 EDT 2024. Contains 372703 sequences. (Running on oeis4.)