cp's OEIS Frontend

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.

A379774 Records in A379772.

This page as a plain text file.
%I A379774 #9 Jul 12 2025 16:06:36
%S A379774 1,2,3,5,6,9,10,11,13,14,16,17,18,19,23,25,26,30,33,38,42,47,48,52,57,
%T A379774 60,61,66,73,81,86,90,93,94,98,105,112,120,124,129,132,138,143,148,
%U A379774 154,155,177,196,203,204,225,228,244,267,269,273,282,300,318,342,345
%N A379774 Records in A379772.
%H A379774 Michael De Vlieger, <a href="/A379774/b379774.txt">Table of n, a(n) for n = 1..171</a>
%t A379774 (* Load function f at A025487 *)
%t A379774 r = 0; s = Select[Union@ Flatten@ f[8][[3 ;; -1]], Not @* SquareFreeQ];
%t A379774 rad[x_] := Times @@ FactorInteger[x][[All, 1]]; nn = Length[s];
%t A379774 Reap[Do[k = s[[i]];
%t A379774   If[# > r, r = #; Sow[r] ] &@
%t A379774     Count[Transpose@ {#, k/#} &@ #[[2 ;; Ceiling[Length[#]/2]]] &@ Divisors[k],
%t A379774       _?((m = GCD @@ {##};
%t A379774       And[! MemberQ[{1, #1, #2}, m],
%t A379774         And[PrimeNu[#1] < PrimeNu[#2], Divisible[#2, rad[#1]]] & @@
%t A379774         SortBy[{##}, PrimeNu]]) & @@ # &)], {i, nn}] ][[-1, 1]]
%Y A379774 Cf. A378767, A379772, A379773.
%K A379774 nonn
%O A379774 1,2
%A A379774 _Michael De Vlieger_, Jan 04 2025