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.

Showing 1-5 of 5 results.

A115806 Sequence A115805 in binary.

Original entry on oeis.org

0, 11, 110, 1100, 11000, 110000, 1100000, 11000000, 11000011, 110000000, 110000011, 110000110, 1100000000, 1100000011, 1100000110, 1100001100, 11000000000, 11000000011, 11000000110, 11000001100, 11000011000
Offset: 0

Views

Author

Antti Karttunen, Feb 01 2006

Keywords

Crossrefs

Cf. a(n) = A007088(A115805(n)). Differs from A115830 for the first time at n=21, where A115830(21)=101110100011 while a(21)=110000000000.

A115803 Integers i such that 11*i = 31 X i.

Original entry on oeis.org

0, 3, 6, 12, 15, 24, 27, 30, 31, 48, 51, 54, 60, 62, 63, 96, 102, 108, 120, 124, 126, 127, 192, 195, 204, 207, 216, 219, 240, 243, 248, 252, 254, 255, 384, 387, 390, 403, 408, 411, 414, 415, 432, 435, 438, 480, 486, 496, 499, 504, 508, 510, 511, 768, 771, 774
Offset: 0

Views

Author

Antti Karttunen, Feb 01 2006

Keywords

Comments

Here * stands for ordinary multiplication and X means carryless (GF(2)[X]) multiplication (A048720).

Links

Crossrefs

Cf. A115804 shows this sequence in binary. Superset of A115805 ?.

A115823 Integers i such that 8*i XOR 13*i = 21*i.

Original entry on oeis.org

0, 3, 5, 6, 10, 12, 20, 21, 24, 40, 41, 42, 48, 79, 80, 82, 84, 85, 96, 158, 160, 163, 164, 168, 169, 170, 192, 195, 316, 320, 323, 325, 326, 328, 329, 335, 336, 338, 340, 341, 384, 387, 389, 390, 632, 633, 640, 643, 645, 646, 650, 652, 656, 658, 670, 672, 675
Offset: 0

Views

Author

Antti Karttunen, Feb 01 2006

Keywords

Links

Crossrefs

XOR is A003987.
Seems to be a superset of A115805. A115825 gives the terms not present in A115805. A115824 shows this sequence in binary.

Programs

Extensions

Definition corrected by Harvey P. Dale, May 02 2012

A115825 Integers i such that 8*i XOR 13*i = 23*i, but 13*i is not 29 X i.

Original entry on oeis.org

5, 10, 20, 21, 40, 41, 42, 79, 80, 82, 84, 85, 158, 160, 163, 164, 168, 169, 170, 316, 320, 323, 325, 326, 328, 329, 335, 336, 338, 340, 341, 389, 632, 633, 640, 643, 645, 646, 650, 652, 656, 658, 670, 672, 675, 676, 680, 681, 682, 773, 778, 1264, 1266
Offset: 1

Views

Author

Antti Karttunen, Feb 01 2006

Keywords

Comments

Here * stands for ordinary multiplication and X means carryless (GF(2)[X]) multiplication (A048720). XOR is given at A003987.

Crossrefs

Cf. Setwise difference of A115823 and A115805. A115826 shows this sequence in binary.

A115829 Integers i such that 10*i XOR 11*i = 21*i.

Original entry on oeis.org

0, 3, 6, 12, 24, 48, 96, 192, 195, 384, 387, 390, 768, 771, 774, 780, 1536, 1539, 1542, 1548, 1560, 2979, 3072, 3075, 3078, 3084, 3096, 3120, 5958, 6144, 6147, 6150, 6156, 6168, 6192, 6240, 11916, 11939, 12288, 12291, 12294, 12300, 12312, 12336, 12384, 12480
Offset: 0

Views

Author

Antti Karttunen, Feb 01 2006

Keywords

Comments

XOR is A003987.
Differs from A115805 for the first time at n = 21, where A115805(21) = 3072 while a(21) = 2979.

Links

Crossrefs

Cf. A003987, A115805, A115830 (shows this sequence in binary).

Programs

  • Mathematica
    Select[Range[0, 20000], BitXor[10*#, 11*#] == 21*# &] (* Paolo Xausa, Sep 29 2024 *)
  • PARI
    is(n)=bitxor(10*n, 11*n)==21*n \\ Charles R Greathouse IV, Sep 25 2024
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.