A335372 -id:A335372 - cp's OEIS frontend

A354960 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier that is a multiple of the number of proper divisors of a(n-1).

1, 2, 3, 4, 6, 9, 8, 12, 5, 7, 10, 15, 18, 20, 25, 14, 21, 24, 28, 30, 35, 27, 33, 36, 16, 32, 40, 42, 49, 22, 39, 45, 50, 55, 48, 54, 56, 63, 60, 11, 13, 17, 19, 23, 26, 51, 57, 66, 70, 77, 69, 72, 44, 65, 75, 80, 81, 52, 85, 78, 84, 88, 91, 87, 90, 99, 95, 93, 96, 110, 98, 100, 64, 102, 105, 112

Offset: 1

Scott R. Shannon, Jul 23 2022

The terms are concentrated along numerous lines, some of which curve upward while others curve downward. See the first linked image. Surprisingly these lines are not shared by terms which are a multiple of a given proper divisor count, but predominantly by terms sharing a certain prime factor. See the second linked image.
The sequence is conjectured to be a permutation of the positive integers although it may take an extremely large number of terms for the primes to appear; e.g., 263 has not occurred after 500000 terms. Also although the vast majority of primes will appear in their natural order, some may not; e.g., a(455) = 840, which has 31 proper divisors, so a(456) = 31, and then a(457) = 29.
In the first 500000 terms the only fixed points beyond the first two are 3, 4, 1159, 1207. It is possible that no more exist, although this is unknown.

			a(3) = 3 as a(2) = 2 which has one proper divisor, and 2 is the smallest unused multiple of 1.
a(5) = 6 as a(4) = 4 which has two proper divisors, and 6 is the smallest unused multiple of 2.
a(9) = 5 as a(8) = 12 which has five proper divisors, and 5 is the smallest unused multiple of 5.

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Annotated log-log scatterplot of a(n), n - 1..2^16, showing records in red, local minima in blue, fixed points in gold, primes in green, and prime powers in cyan.
Michael De Vlieger, Log-log scatterplot of a(n) n = 1..2^12, with a color function indicating tau(a(n-1))-1.
Scott R. Shannon, Image of the first 50000 terms. The green line is y = n.
Scott R. Shannon, Image of the first 50000 terms with color. Terms containing prime factors 17, 13, 11, 7, 5, 3, 2 are colored purple, blue, green, yellow, orange, red, and white respectively. All other terms are colored gray.
Scott R. Shannon, Image of the first 500000 terms.

Cf. A128556 (all divisors), A339793, A000120, A032741, A005179, A027751, A335372.

nn = 76; c[] = False; Array[Set[{a[#], c[#]}, {#, True}] &, 2]; u = 2; Do[k = DivisorSigma[0, a[n - 1]] - 1; m = 1 + Floor[u/k]; While[c[m k], m++]; a[n] = m k; c[m k] = True; If[a[n] == u, While[c[u], u++]], {n, 3, nn}]; Array[a, nn] (* _Michael De Vlieger, Jul 24 2022 *)

A335382 a(0) = 0, a(1) = 1; for n > 1, a(n) = a(n-1) - sigma(n) if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + sigma(n), where sigma(n) is the sum of the divisors of n.

Original entry on oeis.org

0, 1, 4, 8, 15, 9, 21, 13, 28, 41, 23, 11, 39, 25, 49, 73, 42, 24, 63, 43, 85, 53, 17, 41, 101, 70, 112, 72, 16, 46, 118, 86, 149, 197, 143, 95, 186, 148, 88, 32, 122, 80, 176, 132, 48, 126, 54, 6, 130, 187, 94, 22, 120, 66, 186, 114, 234, 154, 64, 124, 292, 230, 134, 30, 157, 241, 97, 29, 155

Offset: 0

Scott R. Shannon, Aug 16 2020

nonn

This sequences uses the same rules as Recamán's sequence A005132 except that, instead of adding or subtracting n each term, the sum of the divisors of n is used. See A000203.
For the first 10 million terms the smallest value not appearing is 76. It is likely that all values are eventually visited, although this is unknown.
In the same range the maximum value is a(9297600) = 93571073, and 402979 terms repeat a previously visited value, the first time this occurs is a(23) = a(9) = 41. The longest run of consecutive increasing terms is 5, starting at a(105187) = 25833, while the longest run of consecutive decreasing terms is 7, starting at a(6826248) = 83016261.

			a(2) = 4. As sigma(2) = 3, and a(1)<3, a(2) = a(1) + 3 = 4.
a(4) = 15. As sigma(4) = 7, and 1 has previously appeared, a(4) = a(3) + 7 = 15.
a(5) = 9. As sigma(5) = 6, and 9 has not previously appeared, a(5) = a(4) - 6 = 9.

Cf. A005132, A000203, A335372, A336760, A336761, A000040.

cp's OEIS Frontend

A354960 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier that is a multiple of the number of proper divisors of a(n-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica