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.

A362132 Records in A362131.

This page as a plain text file.
%I A362132 #9 Apr 14 2023 11:35:58
%S A362132 2,3,4,5,6,7,9,11,13,14,17,20,21,23,29,35,37,38,44,46,50,94,100,120,
%T A362132 121,124,125,136,139,140,142,144,148,178,185,186,187,189,193,195,197,
%U A362132 201,203,209
%N A362132 Records in A362131.
%C A362132 No more records in A362131(n) for n <= 2^28.
%H A362132 Michael De Vlieger, <a href="/A362132/a362132.png">Plot (log_2 A362133(n), a(n)) at (x, y)</a>.
%t A362132 nn = 2^20;
%t A362132 c[_] := False; q[_] := False; h[_] := 0; f[n_] := DivisorSigma[0, n];
%t A362132 a[1] = j = u = w = 1;
%t A362132 Reap[Do[
%t A362132     If[c[j],
%t A362132       k = j + f[u]; h[j]++; h[u]--,
%t A362132       k = f[j]; c[j] = True; h[j]++ ];
%t A362132     u = Min[u, j]; Set[{a[n], q[k], j}, {k, True, k}];
%t A362132     While[h[u] == 0, u++];
%t A362132     If[k == w, While[q[w], w++]; Sow[w]], {n, 2, nn}] ][[-1, -1]]
%Y A362132 Cf. A360179, A362131, A362133.
%K A362132 nonn,more
%O A362132 1,1
%A A362132 _Michael De Vlieger_, Apr 10 2023