Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145609
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145609 Numerator of the polynomial A_l(x) = sum_{d=1..l-1} x^(l-d)/d for index l=2n+1 evaluated at x=1. +0
41
3, 25, 49, 761, 7381, 86021, 1171733, 2436559, 14274301, 55835135, 19093197, 1347822955, 34395742267, 315404588903, 9304682830147, 586061125622639, 54062195834749, 54801925434709, 2053580969474233, 2078178381193813 (list; graph; listen)
OFFSET

1,1

COMMENT

For denominators see A145610.

The polynomials A_{2n+1}(x) = sum_{d=1..2n} x^(2n+1-d)/d for small n look as follows:

n=1, index = 3: A_3(x) = x/2 + x^2.

n=2, index = 5: A_5(x) = x/4 + x^2/3 + x^3/2 + x^4.

n=3, index = 7: A_7(x) = x/6 + x^2/5 + x^3/4 + x^4/3 + x^5/2 + x^6.

n=4, index = 9: A_9(x) = x/8 + x^2/7 + x^3/6 + x^4/5 + x^5/4 + x^6/3 + x^7/2 + x^8.

FORMULA

(1/(2n+1))*2F1(1,2n+1;2n+2;1/m) = Sum_{x=0..infinity} m^(-x)/(x+2n+1) =

m^(2n)arctanh((2m-1)/(2m^2-2m+1))-A_{2n+1}(m) = m^(2n)log(m/(m-1))-A_{2n+1}(m) [Artur Jasinski, Oct 14 2008]

MAPLE

A := proc(l, x) add(x^(l-d)/d, d=1..l-1) ; end: A145609 := proc(n) numer( A(2*n+1, 1)) ; end: seq(A145609(n), n=1..20) ; # R. J. Mathar, Aug 21 2009

MATHEMATICA

m = 1; aa = {}; Do[k = 0; Do[k = k + m^(2 r + 1 - d)/d, {d, 1, 2 r}]; AppendTo[aa, Numerator[k]], {r, 1, 25}]; aa (*Artur Jasinski*)

CROSSREFS

Cf. A145609 - A145640.

Sequence in context: A129599 A042899 A051280 this_sequence A120285 A041897 A006222

Adjacent sequences: A145606 A145607 A145608 this_sequence A145610 A145611 A145612

KEYWORD

frac,nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Oct 14 2008

EXTENSIONS

Edited, parentheses in front of Gauss. Hypg. Fct. added by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 21 2009

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research