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!)
A328732 Irregular table read by rows; for any n >= 0, the n-th row contains the numbers of the form u - v with u + v = n and u AND v = 0 (where AND denotes the bitwise AND operator), in ascending order. 1
0, -1, 1, -2, 2, -3, -1, 1, 3, -4, 4, -5, -3, 3, 5, -6, -2, 2, 6, -7, -5, -3, -1, 1, 3, 5, 7, -8, 8, -9, -7, 7, 9, -10, -6, 6, 10, -11, -9, -7, -5, 5, 7, 9, 11, -12, -4, 4, 12, -13, -11, -5, -3, 3, 5, 11, 13, -14, -10, -6, -2, 2, 6, 10, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
The n-th row:
- has A001316(n) terms,
- has -n as first term and n as last term,
- has least positive term T(n, A001316(n)/2+1)) = A080079(n) (when n > 0).
LINKS
Rémy Sigrist, Table of n, a(n) for n = 0..6562 (Rows for n = 0..256)
EXAMPLE
Table begins:
0;
-1, 1;
-2, 2;
-3, -1, 1, 3;
-4, 4;
-5, -3, 3, 5;
-6, -2, 2, 6;
-7, -5, -3, -1, 1, 3, 5, 7;
-8, 8;
-9, -7, 7, 9;
-10, -6, 6, 10;
-11, -9, -7, -5, 5, 7, 9, 11;
-12, -4, 4, 12;
-13, -11, -5, -3, 3, 5, 11, 13;
...
PROG
(PARI) row(n) = my (r=[0], b=Vecrev(binary(n))); for (k=0, #b-1, if (b[k+1], r=concat(apply(v -> [v-2^k, v+2^k], r)))); Set(r)
CROSSREFS
Sequence in context: A286093 A078827 A157806 * A130795 A367634 A195663
KEYWORD
sign,base,tabf
AUTHOR
Rémy Sigrist, Oct 26 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:31 EDT 2024. Contains 371967 sequences. (Running on oeis4.)