cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A073706 a(n) = Sum_{ d divides n } (n/d)^(3d).

This page as a plain text file.
%I A073706 #23 Nov 05 2017 16:48:46
%S A073706 1,9,28,129,126,1458,344,8705,20413,49394,1332,1104114,2198,2217546,
%T A073706 16305408,33820673,4914,532253187,6860,2392632274,10500716072,
%U A073706 8591716802,12168,422182489826,30517593751,549760658274,7625984925160
%N A073706 a(n) = Sum_{ d divides n } (n/d)^(3d).
%H A073706 Seiichi Manyama, <a href="/A073706/b073706.txt">Table of n, a(n) for n = 1..2096</a>
%F A073706 G.f.: Sum_{n>=1} -log(1 - (n^3)*x^n)/n = Sum_{n>=1} a(n) x^n/n.
%F A073706 G.f.: Sum_{k>=1} k^3*x^k/(1-k^3*x^k). - _Benoit Cloitre_, Apr 21 2003
%e A073706 a(10) = (10/1)^(3*1) +(10/2)^(3*2) +(10/5)^(3*5) +(10/10)^(3*10) = 49394 because positive divisors of 10 are 1, 2, 5, 10.
%t A073706 Table[Total[Quotient[n, x = Divisors[n]]^(3*x)], {n, 27}] (* _Jayanta Basu_, Jul 08 2013 *)
%Y A073706 Sum_{ d divides n } (n/d)^(k*d): A000005 (k=0), A055225 (k=1), A073705 (k=2), this sequence (k=3).
%K A073706 easy,nonn
%O A073706 1,2
%A A073706 _Paul D. Hanna_, Aug 04 2002