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 A293780 #33 Dec 29 2017 23:23:03
%S A293780 1,4,8,16,32,48,54,72,96,108,144,162,192,216,288,324,384,432,486,576,
%T A293780 648,768,864,972,1152,1296,1458,1536,1728,1944,2304,2592,2880,3000,
%U A293780 3240,3600,3750,3840,4050,4320,4500,4800,4860,5400,5760,6000,6480,6750,7200,7290,7500
%N A293780 Where records occur in A008479.
%C A293780 Also values m such that A008479(k) < A008479(m) for all k < m.
%C A293780 Is the squarefree part of a(n); A007913(a(n)) a product of the first primes?
%C A293780 The sequence omega(a(n)) is not nondecreasing; a(1641) and a(1651) are both 7-smooth but a(1640) and a(1650) are divisible by 11.
%C A293780 Is A008479(a(n)) = n?
%C A293780 The least a(n) such that omega(a(n)) gives a record is 4, 48, 2880, 504210, 616319550, 317433916800.
%H A293780 Rémy Sigrist, <a href="/A293780/b293780.txt">Table of n, a(n) for n = 1..2261</a>
%H A293780 Rémy Sigrist, <a href="/A293780/a293780.txt">C++ program for A293780</a>
%e A293780 8 is in the sequence as A008479(k) < A008479(8) for k < 8.
%t A293780 Block[{s = {1}~Join~Array[Times @@ FactorInteger[#][[All, 1]] &, 10^4, 2], t}, t = 1 + Array[Count[Take[s, # - 1], s[[#]]] &, Length@ s]; Map[FirstPosition[t, #][[1]] &, Union@ FoldList[Max, t]] ] (* _Michael De Vlieger_, Oct 21 2017 *)
%o A293780 (C++) See Links section.
%o A293780 (PARI) lista(nn) = {nbm = 0; v = vector(nn, k, factor(k)[,1]); for (n=1, nn, vn = vector(n, k, v[k]); nbn = #select(x->(x==v[n]), vn); if (nbn > nbm, print1(n, ", "); nbm = nbn););} \\ _Michel Marcus_, Oct 30 2017
%Y A293780 Cf. A007913, A008479, A055932, A293781.
%K A293780 nonn
%O A293780 1,2
%A A293780 _David A. Corneth_, Oct 19 2017