A069291 Number of square divisors of n <= sqrt(n).
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2
Offset: 1
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..16384
Programs
-
Mathematica
Table[DivisorSum[n, 1 &, And[IntegerQ@ Sqrt@ #, # <= Sqrt@ n] &], {n, 120}] (* Michael De Vlieger, Nov 20 2017 *)
-
PARI
A069291(n) = sumdiv(n, d, (issquare(d)&&((d^2)<=n))); \\ Antti Karttunen, Nov 20 2017
Formula
G.f.: Sum_{k>=1} x^(k^4) / (1 - x^(k^2)). - Ilya Gutkovskiy, Apr 04 2020
Extensions
More terms from Antti Karttunen, Nov 20 2017
Comments