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.

A362134 Novel terms in A360179, in order of appearance.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 7, 10, 12, 16, 9, 11, 13, 15, 19, 14, 18, 22, 17, 20, 28, 24, 32, 26, 21, 31, 25, 34, 27, 33, 23, 30, 40, 36, 29, 35, 39, 37, 43, 42, 47, 51, 45, 41, 38, 49, 44, 53, 48, 52, 56, 57, 60, 55, 59, 63, 64, 61, 65, 69, 67, 54, 66, 58, 75, 77, 71, 72, 70, 79, 73, 62, 78, 68, 76, 80, 84
Offset: 1

Views

Author

Michael De Vlieger, Apr 10 2023

Keywords

Comments

In other words, numbers A360179(n) that do not appear in A360179(1..n-1).
Row maxima of A360179, read as an irregular triangle of rows whose terms strictly increase.

Examples

			A360179 read as an irregular triangle with rows of length A362135(n):
   n: row n
  --------------
   1: 1;
   2: 1, 2;
   3: 2, 3;
   4: 2, 4;
   5: 3, 5;
   6: 2, 4,  6;
   7: 4, 6,  8;
   8: 4, 7;
   9: 2, 5,  7, 10;
  10: 4, 7, 10, 12;
  11: 6, 8, 12, 16;
  12: 5, 9;
  etc.
Terms in this sequence appear at the end of the rows as consequence of the definition of A360179.
		

Crossrefs

Programs

  • Mathematica
    nn = 800;
    c[] := False; h[] := 0; f[n_] := DivisorSigma[0, n];
    a[1] = j = u = w = 1;
    {1}~Join~Rest@ Reap[Do[
          If[c[j],
            k = j + f[u]; h[j]++; h[u]--,
            k = f[j]; c[j] = True; h[j]++; Sow[j] ];
          u = Min[u, j]; Set[{a[n], q[k], j}, {k, True, k}];
          While[h[u] == 0, u++], {n, 2, nn}] ][[-1, -1]]

Formula

A362127 contains records in this sequence.