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 A104588 #11 Jul 28 2013 17:39:41
%S A104588 1,1,1,2,2,2,2,2,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,30,30,30,30,30,30,30,
%T A104588 30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,210,210,210,210,
%U A104588 210,210,210,210,210,210,210,210,210,210,210,210,210,210,210,210,210,210
%N A104588 Product of primes less than or equal to sqrt(n).
%F A104588 a(n) = A034386(A000196(n)).
%F A104588 For n>0, #p(n) appears {(p(n+1))^2 - (p(n))^2} times [from n=(p(n))^2 to n=(p(n+1))^2 - 1, inclusive], i.e. A002110(n) appears A069482(n) times [from n=A001248(n) to n=A001248(n+1)-1, inclusive]
%p A104588 A104588 := proc(n)
%p A104588 A034386(A000196(n)) ;
%p A104588 end proc: # _R. J. Mathar_, Jul 28 2013
%o A104588 (PARI) a(n) = {pr = 1; forprime (p=2, sqrtint(n), pr *= p;); return (pr);} \\ _Michel Marcus_, Jul 28 2013
%K A104588 nonn
%O A104588 1,4
%A A104588 _Lekraj Beedassy_, Mar 17 2005