Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163971
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163971 G.f.: A(x) = sin( Sum_{n>=0} 2^[(2n+1)^2] * [(2n)!/(n!*2^n)]^2 * x^(2n+1)/(2n+1)! ). +0
2
2, 84, 2516412, 25131689308776, 73459034127708442263660, 59475400379433834763260101514326040, 12984879931670595437855043594849682375333268239320 (list; graph; listen)
OFFSET

1,1

COMMENT

Note that x = sin( Sum_{n>=0} [(2n)!/(n!*2^n)]^2 * x^(2n+1)/(2n+1)! ).

EXAMPLE

G.f.: A(x) = 2*x + 84*x^3 + 2516412*x^5 + 25131689308776*x^7 +...

asin(x) = x + x^3/3! + 3^2*x^5/5! + 15^2*x^7/7! + 105^2*x^9/9! +...

asin(A(x)) = 2*x + 2^9*x^3/3! + 2^25*3^2*x^5/5! + 2^49*15^2*x^7/7! + 2^81*105^2*x^9/9! +...

PROGRAM

(PARI) {a(n)=polcoeff(tanh(sum(k=1, 2*n, 2^((2*k-1)^2)*x^(2*k-1)/(2*k-1)+x*O(x^(2*n)))), 2*n-1)}

CROSSREFS

Cf. A155200, A163970, A001818.

Sequence in context: A099373 A157063 A157315 this_sequence A078166 A101578 A041881

Adjacent sequences: A163968 A163969 A163970 this_sequence A163972 A163973 A163974

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 14 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research