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-3 of 3 results.

A361511 a(1) = 1. Thereafter if a(n-1) is a novel term, a(n) = d(a(n-1)); otherwise, if a(n-1) is the t-th non-novel term, a(n) = a(n-1) + d(a(t)), where d is the divisor function A000005.

Original entry on oeis.org

1, 1, 2, 2, 3, 2, 4, 3, 5, 2, 4, 6, 4, 7, 2, 4, 6, 8, 4, 7, 11, 2, 5, 7, 9, 3, 6, 10, 4, 8, 11, 13, 2, 4, 6, 8, 10, 13, 15, 4, 8, 12, 6, 9, 13, 15, 17, 2, 4, 7, 11, 15, 19, 2, 4, 8, 11, 15, 21, 4, 8, 11, 13, 17, 19, 21, 24, 8, 10, 12, 16, 5, 7, 9, 12, 16, 18, 6, 10, 14, 4, 7, 11, 13, 15, 17, 19, 23
Offset: 1

Views

Author

N. J. A. Sloane, Apr 08 2023

Keywords

Comments

Inspired by A360179, but uses a simpler rule for non-novel terms.
It is an obvious conjecture that every number eventually appears, but is there a proof?

Examples

			The initial terms (in the third column, N = novel term, D = non-novel term):
  .n.a(n).....t
  .1,..1,.N,
  .2,..1,.D,..1
  .3,..2,.N,
  .4,..2,.D,..2
  .5,..3,.N,
  .6,..2,.D,..3
  .7,..4,.N,
  .8,..3,.D,..4
  .9,..5,.N,
  10,..2,.D,..5
  11,..4,.D,..6
  12,..6,.N,
  13,..4,.D,..7
  14,..7,.N,
  15,..2,.D,..8
  16,..4,.D,..9
  17,..6,.D,.10
  18,..8,.N,
  19,..4,.D,.11
  20,..7,.D,.12
  21,.11,.N,
  22,..2,.D,.13
...
If n=8, for example, a(8) = 3 is a non-novel term, the 4th such, so a(9) = a(8) + d(a(4)) = 3 + d(2) = 5.
Comment from _Michael De Vlieger_, Apr 08 2023 (Start)
Can be read as an irregular triangle of increasing subsequences:
  1;
  1, 2;
  2, 3;
  2, 4;
  3, 5;
  2, 4,  6;
  4, 7;
  2, 4,  6, 8;
  4, 7, 11;
  2, 5,  7, 9;
  3, 6, 10;
  4, 8, 11, 13;
  2, 4,  6,  8, 10, 13, 15;
  4, 8, 12;
  6, 9, 13, 15, 17;
  2, 4,  7, 11, 15, 19;
  etc.
(End)
The rows end with the novel terms - see A361512, A361513 - and their lengths are given by A361514.
		

Crossrefs

Programs

  • Mathematica
    nn = 120; c[] = False; f[n] := DivisorSigma[0, n]; a[1] = m = 1; Do[(If[c[#], a[n] = # + f[a[m]] ; m++, a[n] = f[#] ]; c[#] = True) &[a[n - 1]], {n, 2, nn}]; Array[a, nn] (* Michael De Vlieger, Apr 08 2023 *)

A361513 Novel terms in A361511, in order of appearance.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Apr 08 2023

Keywords

Comments

By definition the terms are distinct. It is an obvious conjecture that every number eventually appears, but is there a proof?

Crossrefs

Programs

  • Mathematica
    nn = 615; c[] = False; f[n] := DivisorSigma[0, n]; a[1] = m = 1; Reap[Do[(If[c[#], a[n] = # + f[a[m]] ; m++, a[n] = f[#] ; Sow[#]]; c[#] = True) &[a[n - 1]], {n, 2, nn}] ][[-1, -1]] (* Michael De Vlieger, Apr 08 2023 *)

A361514 Lengths of rows when A361511 is regarded as an irregular triangle.

Original entry on oeis.org

1, 2, 2, 2, 2, 3, 2, 4, 3, 4, 3, 4, 7, 3, 5, 6, 6, 8, 4, 6, 3, 8, 6, 6, 6, 9, 5, 8, 6, 8, 5, 7, 7, 9, 8, 9, 9, 9, 12, 9, 10, 10, 10, 10, 14, 7, 15, 11, 14, 7, 14, 11, 15, 9, 11, 12, 10, 15, 10, 14, 16, 10, 14, 11, 13, 13, 15, 13, 14, 15, 19, 14, 13, 17, 18, 12, 13, 14, 13, 16
Offset: 1

Views

Author

N. J. A. Sloane, Apr 08 2023

Keywords

Comments

Essentially the first differences of A361512.

Crossrefs

Programs

  • Mathematica
    nn = 750; c[] = False; f[n] := DivisorSigma[0, n]; a[1] = k = m = 1; MapAt[# + 1 &, #, 1] &@ Reap[Do[(If[c[#], a[n] = # + f[a[m]] ; m++, a[n] = f[#] ; Sow[n - k - 1]; Set[k, n - 1]]; c[#] = True) &[a[n - 1]], {n, 2, nn}] ][[-1, -1]] (* Michael De Vlieger, Apr 08 2023 *)
Showing 1-3 of 3 results.