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.

A029471 Numbers k that divide the (left) concatenation of all numbers <= k written in base 2 (most significant digit on left).

Original entry on oeis.org

1, 85, 145, 245, 1189, 356717, 19590671, 35741759, 791822369, 25313027035
Offset: 1

Views

Author

Keywords

Comments

No other terms below 3*10^10.

Crossrefs

Programs

  • Mathematica
    b = 2; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[#, b], c], b], #] &] (* Robert Price, Mar 12 2020 *)
  • Python
    from itertools import count
    def a029471():
        total = 0
        power_of_two = 1
        index_of_two = 0
        length_of_string = 0
        for n in count(1):
            total += (n<Christian Perfect, Feb 07 2014
    
  • Python
    def concat_mod(base, k, mod): ...  # See A029479
    for k in range(1, 3*10**10):
      if concat_mod(2, k, k) == 0: print(k) # Jason Yuen, Mar 24 2024

Extensions

One more term from Larry Reeves (larryr(AT)acm.org), Dec 03 2001
Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
a(7)-a(8) from Max Alekseyev, May 12 2011
a(9)-a(10) from Jason Yuen, Mar 24 2024

A362966 Numbers k such that A007908(k) == 1 (mod k).

Original entry on oeis.org

1, 121487, 293957, 13449179, 549999887
Offset: 1

Views

Author

Max Alekseyev, Jun 06 2023

Keywords

Comments

a(6) > 10^11. - Jason Yuen, Oct 12 2024

Crossrefs

Programs

  • Python
    # See A029455 for concat_mod
    def isok(k): return concat_mod(10, k, k)==1%k # Jason Yuen, Oct 12 2024
Showing 1-2 of 2 results.