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.

A065201 Numbers having a non-maximal prime-factor with exponent greater than 1.

This page as a plain text file.
%I A065201 #10 Mar 19 2025 08:30:53
%S A065201 12,20,24,28,36,40,44,45,48,52,56,60,63,68,72,76,80,84,88,90,92,96,99,
%T A065201 100,104,108,112,116,117,120,124,126,132,135,136,140,144,148,152,153,
%U A065201 156,160,164,168,171,172,175,176,180,184,188,189,192,196,198,200
%N A065201 Numbers having a non-maximal prime-factor with exponent greater than 1.
%C A065201 If k is a term so is every positive multiple of k. The primitive elements are A096156.
%H A065201 Amiram Eldar, <a href="/A065201/b065201.txt">Table of n, a(n) for n = 1..10000</a>
%e A065201 a(4) = 28 = 2^2 * 7 as 2 < 7.
%t A065201 q[k_] := Max[Most[FactorInteger[k][[;;, 2]]]] > 1; Select[Range[200], q] (* _Amiram Eldar_, Mar 19 2025 *)
%o A065201 (PARI) isok(k) = {my(e = factor(k)[,2]); #e > 1 && vecmax(e[1..#e-1]) > 1;} \\ _Amiram Eldar_, Mar 19 2025
%Y A065201 Complement of A065200. Cf. A065202, A096156.
%K A065201 nonn
%O A065201 1,1
%A A065201 _Reinhard Zumkeller_, Oct 21 2001
%E A065201 Edited by _Franklin T. Adams-Watters_, Oct 27 2006