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.

A361339 a(n) is the smallest k such that A361338(k) = n.

Original entry on oeis.org

1, 112, 139, 219, 373, 719, 1133, 1919, 3377, 17117
Offset: 1

Views

Author

N. J. A. Sloane, Apr 04 2023, based on an email from Michael S. Branicky

Keywords

Examples

			     a(n) n  {the digits reached}
       1  1  {1}
     112  2  {2, 4}
     139  3  {8, 4, 7}
     219  4  {8, 2, 4, 6}
     373  5  {1, 2, 4, 6, 8}
     719  6  {0, 2, 4, 6, 8, 9}
    1133  7  {0, 2, 4, 6, 7, 8, 9}
    1919  8  {0, 2, 4, 5, 6, 7, 8, 9}
    3377  9  {0, 2, 3, 4, 5, 6, 7, 8, 9}
   17117 10  {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
		

Crossrefs

Programs

  • Mathematica
    With[{s = Import["https://oeis.org/A361338/b361338.txt", "Data"][[All, -1]]}, {1}~Join~Table[-1 + FirstPosition[s, k][[1]], {k, 2, 10}]] (* Michael De Vlieger, Apr 04 2023, using bfile at A361338 *)
  • Python
    from itertools import count
    def agen():
        n, adict = 1, dict()
        for k in count(1):
            v = A361338(k) # uses A361338() and reach1() in A361338
            if v not in adict: adict[v] = k
            while n in adict: yield adict[n]; n += 1
            if n == 11: return
    print(list(agen())) # Michael S. Branicky, Apr 04 2023