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 A094348 #31 Feb 22 2020 20:54:24 %S A094348 1,2,4,6,12,24,36,48,60,72,120,180,240,360,420,720,840,1260,1680,2520, %T A094348 5040,7560,10080,15120,20160,25200,27720,30240,45360,50400,55440, %U A094348 83160,110880,166320,221760,277200,332640,360360,498960,554400,665280,720720 %N A094348 Numbers n such that, for some numbers (j,k), j<=k, n is the smallest positive multiple of j (or more) of the first k positive integers. %C A094348 Includes all highly composite numbers (A002182) and least common multiples of 1 through n (A003418). It would be interesting to know: 1) whether or not all deeply composite numbers (A095848, which includes all members of A003418) also belong to this sequence; 2) if 72 is the only member of this sequence not also belonging to A002182 or A095848. %C A094348 465585120 is the first member of A095848 that is not a member of this sequence. The first members that belong to neither A002182 nor A095848 are 72, 30240, 64864800 and 1470268800. - _David Wasserman_, Jun 28 2007 %C A094348 This sequence is also A096179 with duplicates deleted and sorted. Let F(n) be the number of the row of A096179 which has the first occurrence of a(n) and M(n) = max{F(i),i <= n}. Then the following table indicates this connection. %C A094348 n |1,2,3,4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21 %C A094348 a(n)|1,2,4,6,12,24,36,48,60,72,120,180,240,360,420,720,840,1260,1680,2520,5040 %C A094348 F(n)|1,2,4,3, 4, 8,18,16, 5, 9, 8, 18, 16, 9, 7, 16, 15, 21, 16, 9, 16 %C A094348 M(n)|1,2,4,4, 4, 8,18,18,18,18, 18, 18, 18, 18, 18, 18, 18, 21, 21, 21, 21 %C A094348 - _Peter Luschny_, Dec 29 2010 %H A094348 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. %H A094348 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972, p. 844. %H A094348 J. Britton, <a href="http://britton.disted.camosun.bc.ca/perfect/jbperfect.htm">Perfect Number Analyzer</a> %H A094348 Wikipedia, <a href="http://en.wikipedia.org/wiki/Table_of_divisors">Table of divisors</a>. %H A094348 Peter Luschny, <a href="/wiki/User:Peter_Luschny/A057641A094348">More terms</a>, OEIS wiki. %e A094348 72 is a multiple of seven of the first nine positive integers (namely, 1, 2, 3, 4, 6, 8 and 9). It is the smallest positive integer for which this is true. %o A094348 (PARI) \\ Computes the first 50 terms of A094348 %o A094348 A094348() = {local(n,i,R,A,len,count,change,high,lim); %o A094348 lim = 7208000; R = vector(500); A = vector(50); A[1]=1; %o A094348 A[2]=2; A[3]=4; A[4]=6; A[5]=12; count=5; high=0; n=12; %o A094348 while(n < lim, d=divisors(n); len=length(d); change=0; %o A094348 for(i=1,min(len,high),if(R[i]>d[i],R[i]=d[i];change=1)); %o A094348 if(len>high,for(i=high+1,len,R[i]=d[i]); high=len); %o A094348 if(change, count++; A[count] = n); n += 12; ); %o A094348 write("A094348.txt", vector(count, i, A[i])); } %o A094348 \\ _Peter Luschny_, Dec 29 2010 %Y A094348 Cf. A096179, A003418, A002182, A002201, A072938, A106037, A002110. %K A094348 nonn %O A094348 1,2 %A A094348 _Matthew Vandermast_, Jun 18 2004, Oct 12 2008 %E A094348 More terms from _David Wasserman_, Jun 28 2007 %E A094348 Title edited by _Matthew Vandermast_, Nov 20 2010