|
%I #12 Jan 02 2024 02:48:12
%S 1,1,1,1,2,1,1,1,1,2,1,1,2,1,2,1,1,1,1,2,1,1,1,1,3,2,1,1,1,2,1,1,1,1,
%T 2,1,1,1,2,2,2,1,1,1,2,1,1,1,1,3,1,2,1,1,2,1,1,1,1,2,2,1,1,1,3,1,1,1,
%U 1,2,1,1,1,1,3,1,1,2,1,2,1,2,1,1,3,1,1,1,1,2,2,1,1,1,2,1,1,1,1,3
%N Number of centered square numbers dividing n.
%H Robert Israel, <a href="/A300410/b300410.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CenteredSquareNumber.html">Centered Square Number</a>.
%H <a href="/index/Ce#CENTRALCUBE">Index entries for sequences related to centered polygonal numbers</a>.
%F G.f.: Sum_{k>=0} x^(2*k*(k+1)+1)/(1 - x^(2*k*(k+1)+1)).
%F Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = A228048 = 1.440659... . - _Amiram Eldar_, Jan 02 2024
%e a(26) = 2 because 26 has 4 divisors {1, 2, 13, 26} among which 2 divisors {1, 13} are centered square numbers.
%p N:= 100: # for a(1)..a(N)
%p V:= Vector(N,1):
%p for k from 1 do
%p m:= 2*k*(k+1)+1;
%p if m > N then break fi;
%p r:= [seq(i,i=m..N,m)];
%p V[r]:= map(t->t+1, V[r]);
%p od:
%p convert(V,list); # _Robert Israel_, Mar 05 2018
%t nmax = 100; Rest[CoefficientList[Series[Sum[x^(2 k (k + 1) + 1)/(1 - x^(2 k (k + 1) + 1)), {k, 0, nmax}], {x, 0, nmax}], x]]
%Y Cf. A001844, A046951, A228048, A279496, A300409.
%K nonn
%O 1,5
%A _Ilya Gutkovskiy_, Mar 05 2018
|
