[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A323206 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A323206 A(n, k) = hypergeometric([-k, k+1], [-k-1], n), square array read by ascending antidiagonals for n,k >= 0.
(history; published version)
#49 by Peter Luschny at Wed Feb 27 13:23:04 EST 2019
STATUS

editing

approved

#48 by Peter Luschny at Wed Feb 27 13:22:51 EST 2019
FORMULA

A(n, k) = [x^(k+1)] cf(n, x) where cf(n, x) = K_{i>=1} c(i)/b(i) in the notation of Gauß with b(i) = 1, c(1) = 1, c(2) = -x and c(i) = -n*x for i > 2.

MATHEMATICA

nomnum[k_, mn_] := If[k < 2, 1, If[k == 2, -x, -mn x]];

cf[n_, len_] := ContinuedFractionK[nomnum[k, n], 1, {k, len + 2}];

STATUS

approved

editing

#47 by Peter Luschny at Wed Feb 27 10:49:38 EST 2019
STATUS

editing

approved

#46 by Peter Luschny at Wed Feb 27 10:49:33 EST 2019
MATHEMATICA

(* Alternative *): *)

(* Continued fraction: *)

nom[k_, m_] := If[k < 2, 1, If[k == 2, -x, -m x]];

cf[n_, len_] := ContinuedFractionK[nom[k, n], 1, {k, len + 2}];

Arow[n_, len_] := Rest[CoefficientList[Series[cf[n, len], {x, 0, len}], x]];

For[n = 0, n < 9, n++, Print[Arow[n, 8]]]

STATUS

approved

editing

#45 by Peter Luschny at Wed Feb 27 06:38:55 EST 2019
STATUS

editing

approved

#44 by Peter Luschny at Wed Feb 27 06:37:50 EST 2019
PROG

{A(n, k) = polcoeff((1/x)*serreverse(x*((1+(n-1)*(-x))/((1-(-x))^2) + )+x*O(x^k))), k)}

#43 by Peter Luschny at Wed Feb 27 06:37:22 EST 2019
PROG

(PARI)

{A(n, k) = polcoeff((1/x)*serreverse(x*((1+(n-1)*(-x))/((1-(-x))^2) + x*O(x^k))), k)}

for(n=0, 8, for(k=0, 8, print1(A(n, k), ", ")); print())

STATUS

approved

editing

#42 by Peter Luschny at Wed Feb 27 05:38:52 EST 2019
STATUS

editing

approved

#41 by Peter Luschny at Wed Feb 27 05:37:15 EST 2019
FORMULA

A(k, n, k) = Sum_{j=0..nk} (binomial(2*nk-j, nk) - binomial(2*nk-j, nk+1))*k^(n^(k-j).

A(k, n, k) = Sum_{j=0..nk} binomial(nk + j, nk)*(1 - j/(nk + 1))*kn^j (cf. A009766).

A(k, n, k) = 1 + Sum_{j=0..nk-1} ((1+j)*binomial(2*nk-j, nk+1)/(nk-j))*k^(n^(k-j).

A(k, n, k) ~ ((4*n)^k/(Pi^(1/2)*k^(3/2)))*(1+1/(2*n-1))^2.

STATUS

approved

editing

Discussion
Wed Feb 27 05:38
Peter Luschny: Changed name of variables (k,n) -> (n,k) in some formulas in order to make things more consistent.
#40 by Peter Luschny at Wed Feb 27 04:47:05 EST 2019
STATUS

editing

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 07:09 EDT 2024. Contains 375532 sequences. (Running on oeis4.)