login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255912 O.g.f.: exp( Sum_{n>=1} A000364(2*n)*x^n/n ), where A000364 is the Euler numbers. 0
1, 5, 705, 904405, 4852631105, 74099113400805, 2586129891894933505, 178907219873738420449205, 22190820320340007699602667905, 4580340005051337829651272441809605, 1485137988777113358037521465779043594305, 722514649061693644099760448944719529057242005 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) == 5 (mod 100) for n>=1 (conjecture).

LINKS

Table of n, a(n) for n=0..11.

EXAMPLE

O.g.f.: A(x) = 1 + 5*x + 705*x^2 + 904405*x^3 + 4852631105*x^4 +...

where

log(A(x)) = 5*x + 1385*x^2/2 + 2702765*x^3/3 + 19391512145*x^4/4 + 370371188237525*x^5/5 + 15514534163557086905*x^6/6 + +...+ A000364(2*n)*x^n/n +...

PROG

(PARI) /* By definition */

{A000364(n)=polcoeff(sum(m=0, n, (2*m)!/2^m * x^m/prod(k=1, m, 1+k^2*x+x*O(x^n))), n)}

{a(n)=local(A=1); A=exp(sum(m=1, n, A000364(2*m)*x^m/m) +x*O(x^n)); polcoeff(A, n)}

for(n=0, 20, print1(a(n), ", "))

CROSSREFS

Cf. A255881, A255895, A000364.

Sequence in context: A281585 A071772 A201005 * A213932 A199089 A260481

Adjacent sequences:  A255909 A255910 A255911 * A255913 A255914 A255915

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Mar 10 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 13:00 EDT 2020. Contains 337272 sequences. (Running on oeis4.)