Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060237
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060237 n!^2 *(sum{m=1 to n} sum{k=1 to m}[1/(k m)]). +0
2
1, 7, 85, 1660, 48076, 1942416, 104587344, 7245893376, 628308907776, 66687811660800, 8506654697548800, 1284292319599411200, 226530955276874956800, 46165213716463676620800 (list; graph; listen)
OFFSET

1,2

FORMULA

a[n] = a[n-1] *n^2 + (n-1)! *n! *(sum{k=1 to n}[1/k])

Sum_{n>=0} a(n)*x^n/n!^2 = -dilog(1/(1-x))/(1-x). a(n) = n!^2*Sum_{k=1..n} (-1)^(k+1)*binomial(n, k)/k^2. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 29 2005

EXAMPLE

a(2) = 2!^2 *(1/(1*1) + 1/(1*2) + 1/(2*2)) = 7.

CROSSREFS

Essentially the same as A000424.

Sequence in context: A056547 A121020 A000424 this_sequence A000686 A102923 A092586

Adjacent sequences: A060234 A060235 A060236 this_sequence A060238 A060239 A060240

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Mar 21 2001

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research