OFFSET
1,1
COMMENTS
Record values are seen when n = A120389(m). Conjecture: at each new record the count of the prior record follows A247509. Records seen are 2, 3, 5, 7, 11, ... and when 3, 5, 7, 11 are first seen, there have been 3, 3, 2, and 4 occurrences of 2, 3, 5, and 7. These are A247509(1) through A247509(4). Thus, the count for prime(60) would be A247509(60). - Bill McEachen, Jun 17 2024
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
DeleteCases[Table[FactorInteger[n][[1, 1]] * Boole[Not[PrimeQ[n]]], {n, 2, 100}], 0] (* Alonso del Arte, Aug 21 2014 *)
FactorInteger[#][[1, 1]]&/@Select[Range[200], CompositeQ] (* Harvey P. Dale, Mar 16 2023 *)
PROG
(Magma) [ PrimeDivisors(n)[1]: n in [2..140] | not IsPrime(n) ]; // Klaus Brockhaus, Jun 23 2009
(Haskell)
a056608 = a020639 . a002808 -- Reinhard Zumkeller, Mar 29 2014
(PARI) forcomposite(n=1, 1e2, p=factor(n)[1, 1]; print1(p, ", ")) \\ Felix Fröhlich, Aug 03 2014
(Python)
from sympy import composite, factorint
def A056608(n):
return min(factorint(composite(n))) # Chai Wah Wu, Jul 22 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Odimar Fabeny, Aug 07 2000
EXTENSIONS
More terms from James A. Sellers, Aug 25 2000
Definition corrected by Reinhard Zumkeller, Mar 29 2014
Name changed by Alonso del Arte, Aug 21 2014
STATUS
approved