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.

A195331 A080670 applied to A195330(n).

Original entry on oeis.org

25, 26, 34, 112, 53, 27, 132, 35, 28, 172, 265, 73, 192, 353, 273, 345, 267, 235, 29, 232, 347, 54, 275, 273, 36, 283, 292, 537, 277, 312, 210, 373, 355, 254, 285, 113, 372, 236, 293, 412, 357, 573, 287, 432, 354, 211, 37, 133, 472, 74, 2355, 2254, 295, 2534, 2583, 2113, 2372, 2373, 2643, 532, 2811, 2589, 2236, 2723, 2647, 2103, 2597, 55, 2672, 2752, 2813, 2412, 3353, 2653, 2357, 2573, 2733, 592, 3443, 297, 365, 2432, 2729, 612, 2354, 2659, 3447, 2835, 2435, 2661, 2731
Offset: 1

Views

Author

N. J. A. Sloane, Sep 15 2011

Keywords

Comments

A195330 gives the numbers k such that A080670(k) < k; this sequence gives the corresponding values of A080670(k).

Crossrefs

Programs

  • Maple
    b:= proc(n) option remember; `if`(n=1, 1, (l->
          parse(cat(seq(`if`(l[i, 2]=1, l[i, 1], [l[i, 1],
          l[i, 2]][]), i=1..nops(l)))))(sort(ifactors(n)[2])))
        end:
    g:= proc(n) option remember; local k; for k from
          `if`(n=1, 0, g(n-1))+1 while b(k)>=k do od; k
        end:
    a:= n-> b(g(n)):
    seq(a(n), n=1..100);  # Alois P. Heinz, Mar 17 2020
  • Mathematica
    A080670 = Cases[Import["https://oeis.org/A080670/b080670.txt", "Table"], {, }][[All, 2]];
    A195330 = Cases[Import["https://oeis.org/A195330/b195330.txt", "Table"], {, }][[All, 2]];
    Table[A080670[[n]], {n, A195330}](* Robert Price, Mar 17 2020 *)