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 A034684 #22 Sep 16 2024 02:50:13
%S A034684 1,2,3,4,5,2,7,8,9,2,11,3,13,2,3,16,17,2,19,4,3,2,23,3,25,2,27,4,29,2,
%T A034684 31,32,3,2,5,4,37,2,3,5,41,2,43,4,5,2,47,3,49,2,3,4,53,2,5,7,3,2,59,3,
%U A034684 61,2,7,64,5,2,67,4,3,2,71,8,73,2,3,4,7,2,79,5,81,2,83,3,5,2,3,8,89,2,7,4
%N A034684 If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = min { p_i^e_i }.
%C A034684 a(1) = 1; for n > 1, smallest unitary divisor of n that is larger than 1.
%H A034684 T. D. Noe, <a href="/A034684/b034684.txt">Table of n, a(n) for n = 1..1000</a>
%F A034684 a(n) = min{A141809(n,k): k=1..A001221(n)}. - _Reinhard Zumkeller_, Jan 29 2013
%F A034684 a(n) = n/A052125(n). - _Amiram Eldar_, Sep 16 2024
%t A034684 A034684[n_]:=Min[(#[[1]]^#[[2]])&/@FactorInteger[n]]; Array[A034684,100] (* _Enrique Pérez Herrero_, Nov 01 2011 *)
%o A034684 (PARI) A034684(n) = {local(f,m);if(n==1,1,f=factor(n);m=f[1,1]^f[1,2];for(i=1,matsize(f)[1],m=min(m,f[i,1]^f[i,2]));m)} \\ _Michael B. Porter_, Jan 28 2010
%o A034684 (Haskell)
%o A034684 a034684 = minimum . a141809_row -- _Reinhard Zumkeller_, Jan 29 2013
%Y A034684 Cf. A020639, A006530, A034684, A028233, A034699, A053585.
%Y A034684 Cf. A034444, A034448, A052125.
%Y A034684 Cf. A001221, A008475, A141809.
%K A034684 nonn,nice,easy
%O A034684 1,2
%A A034684 _Erich Friedman_