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.

A369937 Numbers whose maximal exponent in their prime factorization is square.

This page as a plain text file.
%I A369937 #7 Feb 06 2024 08:14:31
%S A369937 1,2,3,5,6,7,10,11,13,14,15,16,17,19,21,22,23,26,29,30,31,33,34,35,37,
%T A369937 38,39,41,42,43,46,47,48,51,53,55,57,58,59,61,62,65,66,67,69,70,71,73,
%U A369937 74,77,78,79,80,81,82,83,85,86,87,89,91,93,94,95,97,101,102
%N A369937 Numbers whose maximal exponent in their prime factorization is square.
%C A369937 First differs from A366762 at n = 84, and from A197680, A361177 and A369210 at n = 95.
%C A369937 Numbers k such that A051903(k) is square.
%C A369937 The asymptotic density of this sequence is 1/zeta(2) + Sum_{k>=2} (1/zeta(k^2+1) - 1/zeta(k^2)) = 0.64939447949574562687... .
%H A369937 Amiram Eldar, <a href="/A369937/b369937.txt">Table of n, a(n) for n = 1..10000</a>
%t A369937 Select[Range[100], IntegerQ@ Sqrt[Max[FactorInteger[#][[;; , 2]]]] &]
%o A369937 (PARI) lista(kmax) = for(k = 1, kmax, if(k == 1 || issquare(vecmax(factor(k)[, 2])), print1(k, ", ")));
%Y A369937 Cf. A000290, A013661, A051903.
%Y A369937 Subsequences: A002416, A005117, A030514, A030635, A113849, A178739, A179665, A179692, A197680.
%Y A369937 Similar sequences: A368714, A369938, A369939.
%Y A369937 Cf. A361177, A366762, A369210.
%K A369937 nonn,easy
%O A369937 1,2
%A A369937 _Amiram Eldar_, Feb 06 2024