A306353 Number of composites among the first n composite numbers whose least prime factor p is that of the n-th composite number.
1, 2, 3, 1, 4, 5, 6, 2, 7, 8, 9, 3, 10, 11, 1, 12, 4, 13, 14, 15, 5, 16, 2, 17, 18, 6, 19, 20, 21, 7, 22, 23, 1, 24, 8, 25, 26, 3, 27, 9, 28, 29, 30, 10, 31, 4, 32, 33, 11, 34, 35, 36, 12, 37, 2, 38, 39, 13, 40, 41, 5, 42, 14, 43, 44, 3, 45, 15, 46, 6, 47, 48, 16, 49, 50, 51, 17, 52, 53, 54, 18, 55, 56, 7
Offset: 1
Examples
First composite 4, least prime factor is 2, first case for 2 so a(1)=1. Next composite 6, least prime factor is 2, second case for 2 so a(2)=2. Next composite 8, least prime factor is 2, third case for 2 so a(3)=3. Next composite 9, least prime factor is 3, first case for 3 so a(4)=1. Next composite 10, least prime factor is 2, fourth case for 2 so a(5)=4.
Links
- Jamie Morken, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
counts = {} values = {} For[i = 2, i < 130, i = i + 1, If[PrimeQ[i], , x = PrimePi[FactorInteger[i][[1, 1]]]; If[Length[counts] >= x, counts[[x]] = counts[[x]] + 1; AppendTo[values, counts[[x]]], AppendTo[counts, 1]; AppendTo[values, 1]]]] (* Print[counts] *) Print[values]
-
PARI
c(n) = for(k=0, primepi(n), isprime(n++)&&k--); n; \\ A002808 a(n) = my(c=c(n), lpf = vecmin(factor(c)[,1]), nb=0); for(k=2, c, if (!isprime(k) && vecmin(factor(k)[,1])==lpf, nb++)); nb; \\ Michel Marcus, Feb 10 2019
Comments