OFFSET
1,6
LINKS
Fintan Costello, Table of n, a(n) for n = 1..1000
FORMULA
a(n+1) = a(n)+b(n)(c(n)+d(n)), where b(n) is 1 if n is squarefree, 0 otherwise (sequence A008966), c(n) is 1 if n is composite, 0 otherwise (sequence A066247), and d(n) is the number of primes less than the minimum prime factor of n. Since d(2n)=0 for all n we see that a(2n+1)=a(2n)+b(2n)c(2n). Taking f(n) to represent sequence A038802 we have a(2n)=a(2n-1)+b(2n-1)(c(2n-1)+f(n-1)).
EXAMPLE
For n=6 the only squarefree composite integers greater than or equal to 6 all of whose proper divisors are all less than 6 are 6, 10 and 15. Since there are 3 such integers, a(6)=3.
MATHEMATICA
Join[{0}, Table[Length[Select[Range[n, n^2], SquareFreeQ[#] && ! PrimeQ[#] && Divisors[#][[-2]] < n &]], {n, 2, 100}]] (* T. D. Noe, Mar 01 2011 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Fintan Costello, Mar 01 2011
EXTENSIONS
more
STATUS
approved