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-2 of 2 results.

A115830 Sequence A115829 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, 101110100011, 110000000000, 110000000011, 110000000110
Offset: 0

Views

Author

Antti Karttunen, Feb 01 2006

Keywords

Comments

Differs from A115806 for the first time at n = 21, where A115806(21) = 110000000000 while a(21) = 101110100011.

Crossrefs

Cf. A007088, A115806, A115829.

Programs

  • Mathematica
    Map[FromDigits[IntegerDigits[#, 2]] &, Select[Range[0, 20000], BitXor[10*#, 11*#] == 21*# &]] (* Paolo Xausa, Sep 29 2024 *)

Formula

a(n) = A007088(A115829(n)).

A115805 Integers i such that 13*i = 29 X 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, 3072, 3075, 3078, 3084, 3096, 3120, 6144, 6147, 6150, 6156, 6168, 6192, 6240, 12288, 12291, 12294, 12300, 12312, 12336, 12384, 12480, 12483
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. Subset of A115803 and also of A115823 ? Differs from A115829 for the first time at n=21, where A115829(21)=2979 while a(21)=3072. A115806 shows this sequence in binary.
Showing 1-2 of 2 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.