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 A387364 #20 Sep 03 2025 10:50:43
%S A387364 6,15,10,21,14,55,46,33,22,39,26,85,82,51,34,57,38,115,118,69,46,141,
%T A387364 142,145,159,87,58,93,62,259,314,185,202,111,74,205,226,123,82,129,86,
%U A387364 235,262,141,94,371,291,265,298,159,106,321,327,295,334,177,118,183
%N A387364 Least number which is not a prime power and whose prime factors are equal modulo n.
%H A387364 Robert G. Wilson v, <a href="/A387364/b387364.txt">Table of n, a(n) for n = 1..10000</a>
%e A387364 For n = 2, factors of a(2) = 15 are 3 and 5, they both have a residue of 1 mod 2.
%t A387364 a[n_]:=Module[{k=1},Until[!PrimePowerQ[k]&&Min[Mod[First/@FactorInteger[k],n]]==Max[Mod[First/@FactorInteger[k],n]],k++];k];Array[a,58] (* _James C. McMahon_, Sep 03 2025 *)
%o A387364 (PARI) f(k, n) = if (!isprimepower(k), my(f=factor(k)[,1]); #Set(apply(x->Mod(x, n), f)) == 1);
%o A387364 a(n) = my(k=1); while (!f(k,n), k++); k; \\ _Michel Marcus_, Aug 27 2025
%Y A387364 First term of A380758 when n = 10.
%K A387364 nonn,new
%O A387364 1,1
%A A387364 _Yaroslav Deryavko_, Aug 27 2025