|
%I #48 May 14 2023 09:40:37
%S 2,3,4,5,7,8,9,11,12,13,16,17,18,19,20,23,24,25,27,28,29,31,32,37,40,
%T 41,43,44,45,47,48,49,50,52,53,54,56,59,60,61,63,64,67,68,71,72,73,75,
%U 76,79,80,81,83,84,88,89,90,92,96,97,98,99,101,103,104
%N Numbers with a unique largest prime exponent.
%C If the prime factorization of k has a unique largest exponent, then k is a term.
%C Numbers whose multiset of prime factors (with multiplicity) has a unique mode. - _Gus Wiseman_, May 12 2023
%H Jens Ahlström, <a href="/A356862/b356862.txt">Table of n, a(n) for n = 1..10000</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Mode_(statistics)">Mode (statistics)</a>.
%e Prime powers (A246655) are in the sequence, since they have only one prime exponent in their prime factorization, hence a unique largest exponent.
%e 144 is in the sequence, since 144 = 2^4 * 3^2 and there is the unique largest exponent 4.
%e 225 is not in the sequence, since 225 = 3^2 * 5^2 and the largest exponent 2 is not unique, but rather it is the exponent of both the prime factor 3 and of the prime factor 5.
%t Select[Range[2, 100], Count[(e = FactorInteger[#][[;; , 2]]), Max[e]] == 1 &] (* _Amiram Eldar_, Sep 01 2022 *)
%o (Python)
%o from sympy import factorint
%o from collections import Counter
%o def ok(k):
%o c = Counter(factorint(k)).most_common(2)
%o return not (len(c) > 1 and c[0][1] == c[1][1])
%o print([k for k in range(2, 105) if ok(k)])
%o (Python)
%o from sympy import factorint
%o from itertools import count, islice
%o def A356862_gen(startvalue=2): # generator of terms >= startvalue
%o return filter(lambda n:len(f:=sorted(factorint(n).values(),reverse=True))==1 or f[0]!=f[1],count(max(startvalue,2)))
%o A356862_list = list(islice(A356862_gen(),30)) # _Chai Wah Wu_, Sep 10 2022
%o (PARI) isok(k) = if (k>1, my(f=factor(k), m=vecmax(f[,2]), w=select(x->(f[x,2] == m), [1..#f~])); #w == 1); \\ _Michel Marcus_, Sep 01 2022
%Y Subsequence of A319161 (which has additional terms 1, 180, 252, 300, 396, 450, 468, ...).
%Y Cf. A246655, A356838, A356840.
%Y For factors instead of exponents we have A102750.
%Y For smallest instead of largest we have A359178, counted by A362610.
%Y The complement is A362605, counted by A362607.
%Y The complement for co-mode is A362606, counted by A362609.
%Y Partitions of this type are counted by A362608.
%Y These are the positions of 1's in A362611, for co-modes A362613.
%Y A001221 is the number of prime exponents, sum A001222.
%Y A027746 lists prime factors, A112798 indices, A124010 exponents.
%Y A362614 counts partitions by number of modes, A362615 co-modes.
%Y Cf. A000041, A002865, A051903, A056239, A070003, A247180, A283050, A327473.
%K nonn,easy
%O 1,1
%A _Jens Ahlström_, Sep 01 2022
|
