A383725 a(n) is the least number k such that omega(k) = n and the largest prime factor of k equals the sum of its remaining prime factors, where omega(k) = A001221(k).
30, 3135, 3570, 844305, 1231230, 463798335, 1089218130, 410825520105, 905980145070, 818186519485335, 1461885412557570, 2023416377587710105, 3676255934199278430, 6175645531427513476335, 14590719651042312667890, 29263451149172039260325865, 67794672364404337821058590
Offset: 3
Keywords
Examples
a(3) = 30 is the smallest number having 3 distinct prime factors (namely 2, 3, and 5) such that the largest one is the sum of the others (2 + 3 = 5). a(4) = 3135 is the smallest number having 4 distinct prime factors (namely 3, 5, 11 and 19) such that the largest one is the sum of the others (3 + 5 + 11 = 19).
Crossrefs
Programs
-
PARI
isok(k, n) = my(f=factor(k)); (omega(f)==n) && (vecsum(f[,1]) == 2*vecmax(f[,1])); a(n) = my(k=1); while (!isok(k, n), k++); k; \\ Michel Marcus, May 08 2025
Comments