cp's OEIS Frontend

A362131 a(n) = smallest missing number u in A360179(1..n).

%I A362131 #10 Apr 14 2023 11:36:03
%S A362131 2,2,3,3,4,4,5,5,6,6,6,7,7,7,7,7,9,9,9,9,9,9,9,9,9,9,9,9,9,9,11,11,11,
%T A362131 11,11,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,
%U A362131 14,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,20,20,20,20,20,20,20,20,21,21
%N A362131 a(n) = smallest missing number u in A360179(1..n).
%H A362131 Michael De Vlieger, <a href="/A362131/b362131.txt">Table of n, a(n) for n = 1..40000</a>
%H A362131 Michael De Vlieger, <a href="/A362131/a362131.png">Labeled scatterplot of A360179(n)</a>, n = 1..300, showing a(n) in small red dots, and A360179(n) in large red when A360179(n) = a(n-1).
%t A362131 nn = 120; c[_] := False; q[_] := False; h[_] := 0; f[n_] := DivisorSigma[0, n];
%t A362131 a[1] = j = u = w = 1;
%t A362131 {2}~Join~Reap[Do[
%t A362131      If[c[j],
%t A362131        k = j + f[u]; h[j]++; h[u]--,
%t A362131        k = f[j]; c[j] = True; h[j]++ ];
%t A362131      u = Min[u, j]; Set[{a[n], q[k], j}, {k, True, k}];
%t A362131      While[h[u] == 0, u++]; If[k == w, While[q[w], w++]];
%t A362131      Sow[w], {n, 2, nn}] ][[-1, -1]]
%Y A362131 Cf. A000005, A360179, A362132.
%K A362131 nonn
%O A362131 1,1
%A A362131 _Michael De Vlieger_, Apr 10 2023