cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A253582 a(n) = A252867(n) OR A252867(n+1).

Original entry on oeis.org

1, 3, 7, 15, 14, 7, 15, 29, 23, 15, 27, 26, 15, 31, 57, 47, 46, 43, 47, 55, 59, 56, 29, 61, 63, 95, 114, 54, 55, 63, 93, 87, 63, 107, 87, 63, 110, 93, 63, 110, 95, 87, 90, 95, 119, 123, 125, 119, 111, 125, 127, 175, 159, 127, 227, 159, 127, 230, 159, 127
Offset: 0

Views

Author

Reinhard Zumkeller, Jan 12 2015

Keywords

Comments

Binary coded union of the two sets, which are coded by A252867(n) and by A252867(n+1);
a(n) = A252867(n) + A252867(n+1), as A252867(n) AND A252867(n+1) = 0 by definition of A252867.

Examples

			.   n | A252867(n) |   binary |   a(n) |   binary
. ----+------------+----------+--------+----------
.   0 |          0 |        0 |      1 |        1
.   1 |          1 |        1 |      3 |       11
.   2 |          2 |       10 |      7 |      111
.   3 |          5 |      101 |     15 |     1111
.   4 |         10 |     1010 |     14 |     1110
.   5 |          4 |      100 |      7 |      111
.   6 |          3 |       11 |     15 |     1111
.   7 |         12 |     1100 |     29 |    11101
.   8 |         17 |    10001 |     23 |    10111
.   9 |          6 |      110 |     15 |     1111
.  10 |          9 |     1001 |     27 |    11011
.  11 |         18 |    10010 |     26 |    11010
.  12 |          8 |     1000 |     15 |     1111
.  13 |          7 |      111 |     31 |    11111
.  14 |         24 |    11000 |     57 |   111001
.  15 |         33 |   100001 |     47 |   101111
.  16 |         14 |     1110 |     46 |   101110
.  17 |         32 |   100000 |     43 |   101011
.  18 |         11 |     1011 |     47 |   101111
.  19 |         36 |   100100 |     55 |   110111
.  20 |         19 |    10011 |     59 |   111011
.  21 |         40 |   101000 |     56 |   111000
.  22 |         16 |    10000 |     29 |    11101
.  23 |         13 |     1101 |     61 |   111101
.  24 |         48 |   110000 |     63 |   111111
.  25 |         15 |     1111 |     95 |  1011111
.  26 |         80 |  1010000 |    114 |  1110010
.  27 |         34 |   100010 |     54 |   110110
.  28 |         20 |    10100 |     55 |   110111
.  29 |         35 |   100011 |     63 |   111111
.  30 |         28 |    11100 |     93 |  1011101
		

Crossrefs

Programs

  • Haskell
    import Data.Bits ((.|.))
    a253582 n = a253582_list !! n
    a253582_list = zipWith (.|.) a252867_list $ tail a252867_list :: [Int]
    a253582_list' = zipWith (+) a252867_list $ tail a252867_list