

A080098


Triangle T(n,k) = n OR k, 0<=k<=n, bitwise logical OR, read by rows.


8



0, 1, 1, 2, 3, 2, 3, 3, 3, 3, 4, 5, 6, 7, 4, 5, 5, 7, 7, 5, 5, 6, 7, 6, 7, 6, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 9, 10, 11, 12, 13, 14, 15, 8, 9, 9, 11, 11, 13, 13, 15, 15, 9, 9, 10, 11, 10, 11, 14, 15, 14, 15, 10, 11, 10, 11, 11, 11, 11, 15, 15, 15, 15, 11, 11, 11, 11, 12, 13, 14, 15, 12, 13
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


COMMENTS

A001316(n) = number of numbers k such that n OR k = n in nth row of the triangular array.


LINKS

Rick L. Shepherd, Rows n=0..500 of triangle, flattened
Eric Weisstein's World of Mathematics, OR.


EXAMPLE

Triangle begins:
0,
1, 1,
2, 3, 2,
3, 3, 3, 3,
4, 5, 6, 7, 4,
5, 5, 7, 7, 5, 5,
6, 7, 6, 7, 6, 7, 6,
7, 7, 7, 7, 7, 7, 7, 7,
8, 9, 10, 11, 12, 13, 14, 15, 8,
9, 9, 11, 11, 13, 13, 15, 15, 9, 9,
10, 11, 10, 11, 14, 15, 14, 15, 10, 11, 10,
...


PROG

(Haskell)
import Data.Bits ((..))
a080098 n k = n .. k :: Int
a080098_row n = map (a080098 n) [0..n]
a080098_tabl = map a080098_row [0..]
 Reinhard Zumkeller, Aug 03 2014, Jul 05 2012


CROSSREFS

Cf. A080099 (OR), A051933 (XOR).
Cf. A265705 (IMPL).
Sequence in context: A145653 A266119 A026263 * A083060 A272979 A102351
Adjacent sequences: A080095 A080096 A080097 * A080099 A080100 A080101


KEYWORD

nonn,tabl,look


AUTHOR

Reinhard Zumkeller, Jan 28 2003


STATUS

approved



