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.

A379594 Records in A379592.

This page as a plain text file.
%I A379594 #6 Jan 01 2025 01:48:02
%S A379594 1,2,3,4,5,6,7,8,9,10,11,12,14,15,17,18,19,20,21,23,24,27,28,29,31,32,
%T A379594 34,35,36,39,41,44,47,48,49,53,55,59,62,63,71,72,74,83,84,89,95,96,
%U A379594 104,107,111,119,120,125,127,134,139,143,149,159,161,167,179,180
%N A379594 Records in A379592.
%C A379594 See comments in A379593.
%C A379594 Compare with A036965 and A379554.
%H A379594 Michael De Vlieger, <a href="/A379594/b379594.txt">Table of n, a(n) for n = 1..119</a>
%t A379594 (* Load function f at A025487 *)
%t A379594 r = 0; s = Union@ Flatten@ f[10]; nn = Length[s];
%t A379594 rad[x_] := Times @@ FactorInteger[x][[All, 1]];
%t A379594   Transpose@ Reap[Monitor[
%t A379594     Do[k = s[[i]];
%t A379594       If[# > r, r = #; Sow[r]] &@
%t A379594         Count[Transpose@ {#, k/#} &@ #[[2 ;; Ceiling[Length[#]/2]]] &@ Divisors[k],
%t A379594           _?(And[rad[#1] == rad[#2],
%t A379594             Xor[Divisible[#2, #1],
%t A379594                 Divisible[#1, #2]]] & @@ # &)], {i, nn}], {i, nn}] ][[-1, 1]]
%Y A379594 Cf. A036965, A379554, A379592, A379593.
%K A379594 nonn
%O A379594 1,2
%A A379594 _Michael De Vlieger_, Dec 30 2024