login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175346 a(n) = Sum_{k=1..n^2} d(k), d(k) = number of divisors of k (A000005). 3

%I #26 Oct 25 2023 09:30:25

%S 1,8,23,50,87,140,201,280,373,482,605,746,897,1070,1261,1466,1689,

%T 1932,2189,2468,2761,3074,3405,3764,4127,4518,4925,5360,5807,6276,

%U 6757,7262,7789,8342,8915,9502,10107

%N a(n) = Sum_{k=1..n^2} d(k), d(k) = number of divisors of k (A000005).

%C Generalized sequence: Sum_{k=1..T(n)} d(k). In this sequence T(n)=n^2, in A085831 T(n)=2^n, in A006218 T(n)=n. Other examples not in the OEIS: T(n)=p(n) n-th prime, T(n)=n*(n+1)/2 n-th triangular number, T(n)= F(n) n-th Fibonacci number, etc.

%H Amiram Eldar, <a href="/A175346/b175346.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) ~ 2n^2 log n. [_Charles R Greathouse IV_, Aug 21 2011]

%F a(n) = n^2 + 2*Sum_{k=2..n} floor(n^2/k). - _Chai Wah Wu_, Oct 24 2023

%t Table[Sum[DivisorSigma[0, k], {k, 1, n^2}], {n, 1, 80}] (* _Carl Najafi_, Aug 21 2011 *)

%o (PARI) a(n)=sum(k=1,n^2,numdiv(k)) \\ _Charles R Greathouse IV_, Aug 21 2011

%o (Python)

%o def A175346(n): return (m:=n**2)+(sum(m//k for k in range(2,n+1))<<1) # _Chai Wah Wu_, Oct 24 2023

%Y Cf. A085831, A000005, A006218.

%K nonn

%O 1,2

%A _Ctibor O. Zizka_, Apr 17 2010

%E More terms from _Carl Najafi_, Aug 21 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)