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.

A380034 Records in A380032.

This page as a plain text file.
%I A380034 #5 Jan 15 2025 08:43:31
%S A380034 1,2,3,4,5,6,7,9,12,13,14,15,17,21,28,31,35,41,42,45,51,54,60,61,67,
%T A380034 75,89,90,111,118,133,147,155,163,176,185,186,195,205,231,246,277,307,
%U A380034 323,343,368,369,377,383,411,429,455,471,479,490,502,545,565,567,627
%N A380034 Records in A380032.
%C A380034 See comments in A380032.
%H A380034 Michael De Vlieger, <a href="/A380034/b380034.txt">Table of n, a(n) for n = 1..66</a>
%t A380034 (* Load function f at A025487 *)
%t A380034 r = 0;
%t A380034 s = Select[Union@ Flatten@ f[8][[3 ;; -1]], Not @* SquareFreeQ];
%t A380034 nn = Length[s]; Print[nn];
%t A380034 Reap[Monitor[
%t A380034   Do[k = s[[i]];
%t A380034     If[# > r, r = #; Sow[r]] &@
%t A380034       Count[Transpose@ {#, k/#} &@ #[[2 ;; Ceiling[Length[#]/2]]] &@ Divisors[k],
%t A380034         _?((m = GCD @@ {##};
%t A380034           And[! MemberQ[{1, #2}, m],
%t A380034           m == #1,
%t A380034           ! Divisible[#1, rad[#2]]]) & @@ # &)], {i, nn}], i] ][[-1, 1]]
%Y A380034 Cf. A380032, A380033.
%K A380034 nonn
%O A380034 1,2
%A A380034 _Michael De Vlieger_, Jan 11 2025