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!)
A301432 G.f.: Sum_{n>=0} 3^n * (1+x)^(n^2) / 4^(n+1). 2
1, 21, 1512, 182448, 30845052, 6706403424, 1782361433664, 559861341721920, 202922346528231120, 83358099246202940880, 38271708686845732234752, 19421327571536329073316864, 10794249397953336851774993664, 6521104275997643157262604783616, 4254768377324045826054766465227264, 2981719456871640091643441908508931072 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) is divisible by 21 for n>0 (conjecture).

In general, for s > 1, Sum_{k>=0} binomial(k^2, n) / s^k is asymptotic to 2^(2*n + 1/2) * n^n / (s^(log(s)/8) * exp(n) * (log(s))^(2*n + 1)). - Vaclav Kotesovec, Mar 21 2018

LINKS

Paul D. Hanna, Table of n, a(n) for n = 0..100

FORMULA

G.f.: 1/(4 - 3*q/(1 - 3*q*(q^2-1)/(4 - 3*q^5/(1 - 3*q^3*(q^4-1)/(4 - 3*q^9/(1 - 3*q^5*(q^6-1)/(4 - 3*q^13/(1 - 3*q^7*(q^8-1)/(4 - ...))))))))) where q = (1+x), a continued fraction due to a partial elliptic theta function identity.

G.f.: Sum_{n>=0} 3^n/4^(n+1) * (1+x)^n * Product_{k=1..n} (4 - 3*(1+x)^(4*k-3)) / (4 - 3*(1+x)^(4*k-1)), due to a q-series identity.

a(n) = Sum_{k>=0} 3^k * binomial(k^2, n) / 4^(k+1).

a(n) ~ 2^(2*n - 3/2) * n^n / ((4/3)^(log(4/3)/8) * exp(n) * (log(4/3))^(2*n + 1)). - Vaclav Kotesovec, Mar 21 2018

EXAMPLE

G.f.: A(x) = 1 + 21*x + 1512*x^2 + 182448*x^3 + 30845052*x^4 + 6706403424*x^5 + 1782361433664*x^6 + 559861341721920*x^7 + ...

such that

A(x) = 1/4 + 3*(1+x)/4^2 + 3^2*(1+x)^4/4^3 + 3^3*(1+x)^9/4^4 + 3^4*(1+x)^16/4^5 + 3^5*(1+x)^25/4^6 + 3^6*(1+x)^36/4^7 + 3^7*(1+x)^49/4^8  + 3^8*(1+x)^64/4^9 + ...

MATHEMATICA

Table[Sum[StirlingS1[n, j] * HurwitzLerchPhi[3/4, -2*j, 0]/4, {j, 0, n}] / n!, {n, 0, 20}] (* Vaclav Kotesovec, Mar 21 2018 *)

PROG

(PARI) /* Continued fraction expression: */

{a(n) = my(CF=1, q = 1+x +x*O(x^n)); for(k=0, n, CF = 1/(4 - 3*q^(4*n-4*k+1)/(1 - 3*q^(2*n-2*k+1)*(q^(2*n-2*k+2) - 1)*CF)) ); polcoeff(CF, n)}

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

CROSSREFS

Cf. A301310, A173217, A301311.

Sequence in context: A130332 A035319 A278323 * A220561 A239267 A258305

Adjacent sequences:  A301429 A301430 A301431 * A301433 A301434 A301435

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Mar 21 2018

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 April 22 14:33 EDT 2021. Contains 343177 sequences. (Running on oeis4.)