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 A089090 #14 Jul 25 2022 15:52:35
%S A089090 4,9,4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,49,4,9,
%T A089090 4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,49,4,9,4,9,
%U A089090 4,25,4,9,4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,25,4,9,4,9,4,49,4,9,4,9,4,25,4
%N A089090 a(n) is the smallest composite number coprime to n.
%C A089090 If n is the n-th primorial, then a(n) = prime(n+1)^2.
%H A089090 Antti Karttunen, <a href="/A089090/b089090.txt">Table of n, a(n) for n = 1..16384</a>
%F A089090 a(n) = A053669(n)^2.
%F A089090 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{p prime} ((p^2*(p-1)/Product_{q prime <= p} q)) = 10.3344588090... . - _Amiram Eldar_, Jul 25 2022
%e A089090 n=30: below 30 coprimes to 30 phi(30)=8 numbers are relevant but each 1 or primes; so a(8)>30; the first suitable number is a(30)=49.
%t A089090 m=0;Table[fla=1;Do[s=GCD[n, k];If[Equal[s, 1]&&!PrimeQ[n]&&!Equal[n, 1]&& Equal[fla, 1], m=m+1;Print[n];fla=0], {n, 1, 130}], {k, 1, 256}]
%o A089090 (PARI) A089090(n) = forprime(p=2, , if(n%p, return(p*p))); \\ _Antti Karttunen_, Dec 19 2018
%Y A089090 Cf. A053669, A007978, A053670-A053674, A090091-A090093.
%K A089090 easy,nonn
%O A089090 1,1
%A A089090 _Labos Elemer_, Nov 26 2003
%E A089090 Offset corrected by _Antti Karttunen_, Dec 19 2018