A361511 -id:A361511 - cp's OEIS frontend

A361512 Indices of novel terms in A361511.

1, 3, 5, 7, 9, 12, 14, 18, 21, 25, 28, 32, 39, 42, 47, 53, 59, 67, 71, 77, 80, 88, 94, 100, 106, 115, 120, 128, 134, 142, 147, 154, 161, 170, 178, 187, 196, 205, 217, 226, 236, 246, 256, 266, 280, 287, 302, 313, 327, 334, 348, 359, 374, 383, 394, 406, 416, 431

Offset: 1

N. J. A. Sloane, Apr 08 2023

nonn

Michael De Vlieger, Table of n, a(n) for n = 1..17905 (all terms m <= 2^24)

Cf. A361511.

nn = 432; 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[n - 1]]; c[#] = True) &[a[n - 1]], {n, 2, nn}] ][[-1, -1]] (* 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

N. J. A. Sloane, Apr 08 2023

nonn

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

Michael De Vlieger, Table of n, a(n) for n = 1..17905 (All novel terms in a(n) for n = 1..2^24)

Cf. A361511, A361512.

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

N. J. A. Sloane, Apr 08 2023

nonn

Essentially the first differences of A361512.

Michael De Vlieger, Table of n, a(n) for n = 1..17905

Cf. A361511-A361513.

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 *)

A361516 Indices of records in A361511.

Original entry on oeis.org

1, 3, 5, 7, 9, 12, 14, 18, 21, 32, 39, 47, 53, 59, 67, 94, 134, 170, 196, 236, 256, 280, 394, 441, 455, 519, 547, 589, 635, 778, 809, 862, 875, 946, 961, 975, 1011, 1053, 1110, 1266, 1469, 1538, 1844, 2043, 2277, 2334, 2369, 2423, 2485, 2596, 2711, 2755, 2934, 2990, 3125, 3369, 3436, 3594, 3762, 3984, 4215, 4290, 4432, 4621, 4677, 4712, 4750, 4897

Offset: 1

N. J. A. Sloane, Apr 08 2023

nonn

Michael De Vlieger, Table of n, a(n) for n = 1..6811 (all in a(n) for n = 1..2^28)

Cf. A361511-A361515, A362095.

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

A362095 Records in A361511.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 11, 13, 15, 17, 19, 21, 24, 29, 35, 36, 44, 45, 51, 60, 62, 64, 65, 68, 74, 80, 83, 84, 89, 90, 92, 93, 94, 97, 100, 109, 113, 121, 123, 135, 143, 149, 151, 152, 157, 159, 165, 166, 167, 178, 179, 182, 189, 197, 199, 201, 206, 209, 213, 215, 220, 221, 222, 226, 228, 234, 236, 238, 240, 244, 246, 256, 268, 272, 276, 282, 283

Offset: 1

N. J. A. Sloane, Apr 08 2023

nonn

Michael De Vlieger, Table of n, a(n) for n = 1..6811 (all records in a(n) for n = 1..2^28)

Cf. A361511-A361516.

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

A361515 a(n) = index of first appearance of n in A361511, or -1 if n never appears.

Original entry on oeis.org

1, 3, 5, 7, 9, 12, 14, 18, 25, 28, 21, 42, 32, 80, 39, 71, 47, 77, 53, 100, 59, 115, 88, 67, 147, 120, 106, 128, 94, 154, 187, 142, 178, 161, 134, 170, 226, 205, 246, 327, 287, 217, 313, 196, 236, 334, 506, 348, 266, 302, 256, 359, 406, 374, 481, 416, 471, 383, 431, 280

Offset: 1

N. J. A. Sloane, Apr 08 2023

nonn

Conjecture: This is a permutation of the positive integers.

Michael De Vlieger, Table of n, a(n) for n = 1..17878 (All terms that appear in a(n) for n = 1..2^24)

Cf. A361511-A361514.

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

A360179 a(1) = 1. Thereafter if a(n-1) is a novel term, a(n) = d(a(n-1)); otherwise a(n) = a(n-1) + d(u), where d is the divisor function A000005 and u is the smallest unstarred prior term (each time we use a prior term we star it, and starred terms cannot be reused).

Original entry on oeis.org

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

Offset: 1

David James Sycamore, Jan 29 2023

Whilst the definition is subtly different from that of A345147, d(u) being used in place of u, the scatterplots are remarkably different, the one for this sequence displaying numerous precipitous "gorges" which are open to explanation. 1 is the only number which occurs precisely twice, all other numbers are repeated infinitely many times.
From Michael De Vlieger, Apr 04 2023: (Start)
The sequence is a series of nondecreasing cycles that reach a maximum M and then reset to start a new cycle. (See scatterplot B.)
The sequence is dynamic and responds to a bank of copies of the same number called a "prevailing low" L. When M < L, the sequence experiences a run of short or "crashed" cycles that make no headway at eliminating the copies of L, resulting in a "gorge" in the scatterplot.
Referring to scatterplot A:
The green line represents the smallest missing number u and is not actually a feature of the sequence. The red line represents the "prevailing low" L(n), also is not a feature of the sequence.
Dark blue terms a(n) = tau(a(n-1))..421 populate a "semi-coherent" phase (1A) of cycle c(i), where tau(n) = A000005(n).
Light blue terms a(n) = 422..L populate the "coherent" phase (1B) of cycle c(i). Black terms m > L populate phase (2) of c(i).
Magenta terms constitute a crashed cycle that has M < L; multiple consecutive crashed cycles constitute a gorge. In crashed cycles, we have only phase (1).
The "triple point" of the graph, where we first have phase (1B), appears to be a(14478) = 414, but is in actuality (given 2^20 terms) a(14786) = 422. (End)

			a(2) = 1 since a(1) = 1 is a novel term and d(1) = 1. Thus the sequence starts 1,1 and since a(2) is a repeated term, a(3) = a(2) + d(1) (1 = least unstarred prior term). Therefore a(3) = 1 + 1 = 2.

Michael De Vlieger, Table of n, a(n) for n = 1..40000 [The exceptionally large b-file was added at my request. - _N. J. A. Sloane_, Apr 07 2023]
Michael De Vlieger, Scatterplot A of a(n), n = 1..40000.
Michael De Vlieger, Scatterplot B of a(n) for n = 1..128. Records appear in red, local minima in blue, terms instigated by a(n) = m new to the sequence appear in gold, otherwise in green. The magenta line indicates the smallest missing number u not in a(1..n-1).
Michael De Vlieger, Scatterplot of a(n), n = 1500000.

Cf. A000005, A343887, A345147.
Cf. A362127 records, A362128 indices of records.
Cf. A362129 a(n) mod 2, A362130 d(a(n)) mod 2.
Cf. A362131 smallest missing number in a(1..n).
Cf. A362134 novel terms, A362135 indices of novel terms.
Cf. A362136 row lengths, if this sequence seen as rows of strictly increasing terms.
See A361511 for another version.

nn = 120; c[] := False; h[] := 0; f[n_] := DivisorSigma[0, n]; a[1] = j = u = 1; Do[If[c[j], k = j + f[u]; h[j]++; h[u]--, k = f[j]; c[j] = True; h[j]++]; u = Min[u, j]; Set[{a[n], j}, {k, k}]; While[h[u] == 0, u++], {n, 2, nn}]; Array[a, nn] (* Michael De Vlieger, Feb 02 2023 *)

cp's OEIS Frontend

A361512 Indices of novel terms in A361511.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A361513 Novel terms in A361511, in order of appearance.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A361516 Indices of records in A361511.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A362095 Records in A361511.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A361515 a(n) = index of first appearance of n in A361511, or -1 if n never appears.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A360179 a(1) = 1. Thereafter if a(n-1) is a novel term, a(n) = d(a(n-1)); otherwise a(n) = a(n-1) + d(u), where d is the divisor function A000005 and u is the smallest unstarred prior term (each time we use a prior term we star it, and starred terms cannot be reused).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica