The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328568 Irregular triangle read by rows; for n >= 0, the n-th row corresponds to the elements of the set {(n-k) XOR k, k = 0..n}, in ascending order (where XOR denotes the bitwise XOR operator). 4
 0, 1, 0, 2, 3, 0, 2, 4, 1, 5, 0, 4, 6, 7, 0, 4, 6, 8, 1, 5, 9, 0, 2, 4, 8, 10, 3, 11, 0, 2, 8, 10, 12, 1, 9, 13, 0, 8, 12, 14, 15, 0, 8, 12, 14, 16, 1, 9, 13, 17, 0, 2, 8, 10, 12, 16, 18, 3, 11, 19, 0, 2, 4, 8, 10, 16, 18, 20, 1, 5, 9, 17, 21, 0, 4, 6, 8, 16, 20, 22 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS For any n >= 0, the n-th row: - has sum A328565(n), - has apparently length A002487(n+1), - has first element A135481(n), - has last element n. LINKS Rémy Sigrist, Table of n, a(n) for n = 0..9851 EXAMPLE Table begins:     0;     1;     0, 2;     3;     0, 2, 4;     1, 5;     0, 4, 6;     7;     0, 4, 6, 8;     1, 5, 9;     0, 2, 4, 8, 10;     3, 11;     0, 2, 8, 10, 12;     1, 9, 13;     0, 8, 12, 14;     ... MAPLE T:= n-> sort([{seq(Bits[Xor](n-k, k), k=0..n)}[]])[]: seq(T(n), n=0..30);  # Alois P. Heinz, Oct 20 2019 PROG row(n) = Set(apply(k -> bitxor(n-k, k), [0..n])) CROSSREFS Cf. A326819 (AND variant), A326820 (OR variant). Cf. A002487, A135481, A328565. Sequence in context: A126045 A024307 A267852 * A219864 A257844 A194745 Adjacent sequences:  A328565 A328566 A328567 * A328569 A328570 A328571 KEYWORD nonn,tabf,look,base AUTHOR Rémy Sigrist, Oct 20 2019 STATUS approved

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

Last modified April 7 15:56 EDT 2020. Contains 333306 sequences. (Running on oeis4.)