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

A044873 Numbers having, in base 2, (sum of even run lengths)=(sum of odd run lengths).

Original entry on oeis.org

9, 11, 13, 133, 135, 140, 143, 146, 148, 150, 152, 154, 156, 161, 164, 166, 172, 175, 178, 180, 182, 189, 196, 198, 200, 202, 206, 210, 212, 214, 216, 218, 220, 225, 228, 230, 236, 239, 241, 245, 247, 2065, 2069, 2071, 2077
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Python
    from itertools import groupby
    def ok(n):
        rl_sums = [0, 0]
        for k, g in groupby(bin(n)[2:]):
            rl = len(list(g))
            rl_sums[rl%2] += rl
        return rl_sums[0] == rl_sums[1]
    print(list(filter(ok, range(2078)))) # Michael S. Branicky, Sep 11 2021

A044879 Numbers having, in base 8, (sum of even run lengths)=(sum of odd run lengths).

Original entry on oeis.org

513, 514, 515, 516, 517, 518, 519, 521, 530, 539, 548, 557, 566, 575, 577, 578, 579, 580, 581, 582, 583, 592, 593, 595, 596, 597, 598, 599, 600, 601, 602, 604, 605, 606, 607, 608, 609, 610, 611, 613, 614, 615, 616, 617, 618
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Python
    from itertools import groupby
    def ok(n):
        rl_sums = [0, 0]
        for k, g in groupby(oct(n)[2:]):
            rl = len(list(g))
            rl_sums[rl%2] += rl
        return rl_sums[0] == rl_sums[1]
    print(list(filter(ok, range(619)))) # Michael S. Branicky, Sep 11 2021

A044881 Numbers having, in base 10, (sum of even run lengths)=(sum of odd run lengths).

Original entry on oeis.org

1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1011, 1022, 1033, 1044, 1055, 1066, 1077, 1088, 1099, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1120, 1121, 1123, 1124, 1125, 1126, 1127, 1128, 1129
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Python
    from itertools import groupby
    def ok(n):
        rl_sums = [0, 0]
        for k, g in groupby(str(n)):
            rl = len(list(g))
            rl_sums[rl%2] += rl
        return rl_sums[0] == rl_sums[1]
    print(list(filter(ok, range(1130)))) # Michael S. Branicky, Sep 11 2021

A044887 Numbers having, in base 16, (sum of even run lengths)=(sum of odd run lengths).

Original entry on oeis.org

4097, 4098, 4099, 4100, 4101, 4102, 4103, 4104, 4105, 4106, 4107, 4108, 4109, 4110, 4111, 4113, 4130, 4147, 4164, 4181, 4198, 4215, 4232, 4249, 4266, 4283, 4300, 4317, 4334, 4351, 4353, 4354, 4355, 4356, 4357, 4358
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Python
    from itertools import groupby
    def ok(n):
        rl_sums = [0, 0]
        for k, g in groupby(hex(n)[2:]):
            rl = len(list(g))
            rl_sums[rl%2] += rl
        return rl_sums[0] == rl_sums[1]
    print(list(filter(ok, range(4359)))) # Michael S. Branicky, Sep 11 2021
Showing 1-4 of 4 results.