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.

A357944 If n appears in A357943, a(n) is the smallest k such that A357943(k) = n, otherwise a(n) = -1.

Original entry on oeis.org

0, 1, 2, 5, 33, 8, 15, 22, 28, 25, 35, 65, 69, 78, 123, 165, 180, 97, 105, 203, 115, 294, 199, 373, 326, 238, 300, 506, 350, 354, 361, 367, 380, 388, 392, 408, 491, 573, 628, 498, 502, 509, 513, 516, 744, 615, 683, 763, 1201, 1072, 906, 1083, 872, 1100, 1113, 1364, 1385, 1438, 1274, 1387
Offset: 0

Views

Author

Scott R. Shannon, Oct 22 2022

Keywords

Crossrefs

Cf. A357943.

Programs

  • Mathematica
    nn = 1500; c[] = q[] = 0; Array[Set[{a[#], c[#], q[#]}, {#, 1, #}] &, 3, 0]; Do[(a[n] = c[#]; c[c[#]]++; If[q[c[#]] == 0, Set[q[c[#]], n]]) &[a[n - a[n - 1] - 1]], {n, 3, nn}]; {0}~Join~TakeWhile[Array[q, nn], # > 0 &] (* Michael De Vlieger, Oct 23 2022 *)