Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073706
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073706 a(n) = sum_{ d divides n } (n/d)^(3d). +0
1
1, 9, 28, 129, 126, 1458, 344, 8705, 20413, 49394, 1332, 1104114, 2198, 2217546, 16305408, 33820673, 4914, 532253187, 6860, 2392632274, 10500716072, 8591716802, 12168, 422182489826, 30517593751, 549760658274, 7625984925160 (list; graph; listen)
OFFSET

1,2

FORMULA

G.f.: Sum_{n=1..inf} -ln(1 - (n^3)*x^n)/n = Sum_{n=1..inf} a(n) x^n/n.

G.f.: sum(k>=1, k^3*x^k/(1-k^3*x^k)). - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 21 2003

EXAMPLE

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.

CROSSREFS

Cf. A055225, A073705.

Sequence in context: A001158 A053819 A085292 this_sequence A042501 A041154 A024121

Adjacent sequences: A073703 A073704 A073705 this_sequence A073707 A073708 A073709

KEYWORD

easy,nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 04 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research