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.
%I A073638 #30 Feb 20 2024 06:59:39
%S A073638 1,3,5,7,13,17,32,38,67,137,203,247,472,578,682,787,1463,2047,2363,
%T A073638 3465,5197,5198,8662,13513,15593,22522,22523,29452,60638,67567,67568,
%U A073638 98753,112612,157658,202702,337837,337838,427927,713212,788287,788288,1013512
%N A073638 Number of anti-divisors of n (A066272) sets a record.
%C A073638 antid(n) > antid(k) for all k < n.
%C A073638 Note that several of these come in pairs, i.e., 5197 & 5198, 22522 & 22523, 67567 & 67568, 337837 & 337838, 788287 & 788288, 1013512 & 1013513 and 1914412 & 1914413 to name a few. See A093071 for more. - _Robert G. Wilson v_, Mar 17 2004
%C A073638 See A066272 for definition of anti-divisor.
%H A073638 Donovan Johnson, <a href="/A073638/b073638.txt">Table of n, a(n) for n = 1..117</a> (terms < 5*10^11)
%H A073638 Jon Perry, <a href="http://www.users.globalnet.co.uk/~perry/maths">Anti-divisors</a>.
%H A073638 Jon Perry, <a href="/A066272/a066272a.html">The Anti-divisor</a> [Cached copy]
%H A073638 Jon Perry, <a href="/A066272/a066272.html">The Anti-divisor: Even More Anti-Divisors</a> [Cached copy]
%t A073638 antid[n_] := Select[ Union[ Join[ Select[ Divisors[2n - 1], OddQ[ # ] && # != 1 &], Select[ Divisors[2n + 1], OddQ[ # ] && # != 1 & ], 2n/Select[ Divisors[ 2n], OddQ[ # ] && # != 1 &]]], # < n &]; a = 0; Do[b = Length[ antid[ n]]; If[b > a, Print[n]; a = b], {n, 1, 1013513}] (* _Robert G. Wilson v_, Mar 17 2004 *)
%K A073638 nonn
%O A073638 1,2
%A A073638 _Jason Earls_, Sep 01 2002
%E A073638 More terms from _Robert G. Wilson v_, Mar 17 2004