login
Primitive practical numbers: practical numbers that are squarefree or practical numbers that when divided by any of its prime factors whose factorization exponent is greater than 1 is no longer practical.
14

%I #77 Oct 31 2024 01:38:59

%S 1,2,6,20,28,30,42,66,78,88,104,140,204,210,220,228,260,272,276,304,

%T 306,308,330,340,342,348,364,368,380,390,414,460,462,464,476,496,510,

%U 522,532,546,558,570,580,620,644,666,690,714,740,744,798,812,820,858,860,868,870,888,930,966,984

%N Primitive practical numbers: practical numbers that are squarefree or practical numbers that when divided by any of its prime factors whose factorization exponent is greater than 1 is no longer practical.

%C If n is a practical number and d is any of its divisors then n*d must be practical. Consequently the sequence of all practical numbers must contain members that are either squarefree (A265501) or when divided by any of its prime factors whose factorization exponent is greater than 1 is no longer practical. Such practical numbers are said to be primitive. The set of all practical numbers can be generated from the set of primitive practical numbers by multiplying these primitives by an integer. [Comment corrected by _Frank M Jackson_, Oct 27 2024]

%C Conjecture: every odd number, beginning with 3, is the sum of a prime number and a primitive practical number. This is a tighter conjecture to the conjecture posed by _Hal M. Switkay_ (see A005153).

%C Analogous to the {1 union primes} (A008578) and practical numbers (A005153), the sequence of primitive practical numbers with two extra, practical only, terms added, namely 4 and 8, becomes a "complete" (sic) sequence. - _Frank M Jackson_, Mar 14 2023

%H Amiram Eldar, <a href="/A267124/b267124.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..5000 from Michel Marcus)

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Complete_sequence">"Complete" sequence</a>. [Wikipedia calls a sequence "complete" (sic) if every positive integer is a sum of distinct terms. This name is extremely misleading and should be avoided. - _N. J. A. Sloane_, May 20 2023]

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Practical_number">Practical number</a>, and <a href="http://en.wikipedia.org/wiki/Squarefree_integer">Squarefree integer</a>

%e a(4)=20=2^2*5. It is a practical number because it has 6 divisors 1, 2, 4, 5, 10, 20 that form a complete sequence. If it is divided by 2 the resultant has 4 divisors 1, 2, 5, 10 that is not a complete sequence.

%e a(7)=42=2*3*7. It is squarefree and is practical because it has 8 divisors 1, 2, 3, 6, 7, 14, 21, 42 that form a complete sequence.

%t PracticalQ[n_] := Module[{f, p, e, prod=1, ok=True}, If[n<1||(n>1&&OddQ[n]), False, If[n==1, True, f=FactorInteger[n]; {p, e}=Transpose[f]; Do[If[p[[i]]>1+DivisorSigma[1, prod], ok=False; Break[]]; prod=prod*p[[i]]^e[[i]], {i, Length[p]}]; ok]]]; lst=Select[Range[1, 1000], PracticalQ]; lst1=lst; maxfac=PrimePi[Last[Union[Flatten[FactorInteger[lst], 1]]][[1]]]; Do[lst1=Select[lst1, Mod[#, Prime[p]^2]!=0||!PracticalQ[#/Prime[p]] &], {p, 1, maxfac}]; lst1

%o (PARI) \\ see A005153 for is_A005153

%o isp(n) = {my(f=factor(n)); for (k=1, #f~, if ((f[k,2] > 1) && is_A005153(n/f[k,1]), return (0));); return (1);}

%o is_A267124(n) = is_A005153(n) && (issquarefree(n) || isp(n)); \\ _Michel Marcus_, Jun 19 2019. [Name edited for use in A361872 and elsewhere. - _M. F. Hasler_, Jun 20 2023]

%o (Python)

%o from sympy import factorint

%o def is_primitive(n): # uses is_A005153: see there, please DO NOT copy code here!

%o for i in range(0, len(list(factorint(n)))):

%o if list(factorint(n).values())[i] > 1:

%o if is_A005153(n//list(factorint(n))[i]): return False

%o return True

%o def is_A267124(n):

%o if is_A005153(n) and is_primitive(n):

%o return True # _Karl-Heinz Hofmann_, Mar 09 2023

%Y Cf. A005117, A005153, A265501.

%Y Superset of primorial numbers (A002110) and superset of perfect numbers (A000396).

%K nonn,changed

%O 1,2

%A _Frank M Jackson_, Jan 10 2016