A333806 Number of distinct prime divisors of n that are < sqrt(n).

0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 0, 3, 0, 1, 1, 1, 1, 2, 0, 1, 1, 2, 0, 2, 0, 1, 2, 1, 0, 2, 0, 2, 1, 1, 0, 2, 1, 2, 1, 1, 0, 3, 0, 1, 2, 1, 1, 2, 0, 1, 1, 3, 0, 2, 0, 1, 2, 1, 1, 2, 0, 2, 1, 1, 0, 3, 1, 1, 1, 1, 0, 3

Offset

1,12

Comments

a(n) = 0 if and only if n = p^k where p is prime and k is 0, 1, or 2. - Charles R Greathouse IV, Apr 07 2020

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Formula

G.f.: Sum_{k>=1} x^(prime(k)*(prime(k) + 1)) / (1 - x^prime(k)).

Maple

N:= 100: # for a(1)..a(N)
V:= Vector(N):
p:= 1:
do
  p:= nextprime(p);
  if p^2 >= N then break fi;
  L:= [seq(p*k, k=p+1..N/p)];
  V[L]:= V[L]+~1
od:
convert(V, list); # Robert Israel, Apr 07 2020

Mathematica

Table[DivisorSum[n, 1 &, # < Sqrt[n] && PrimeQ[#] &], {n, 1, 90}]
nmax = 90; CoefficientList[Series[Sum[x^(Prime[k] (Prime[k] + 1))/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

Prog

(PARI) a(n)=my(f=factor(n)[, 1]); sum(i=1, #f, f[i]^2<n) \\ Charles R Greathouse IV, Apr 07 2020

Crossrefs

Cf. A001221, A056924, A063962, A333805, A333808.

Sequence in context: A117454 A115357 A171182 * A340832 A063962 A084114

Adjacent sequences: A333803 A333804 A333805 * A333807 A333808 A333809

Keyword

nonn

Author

Ilya Gutkovskiy, Apr 05 2020

Status

approved