The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A098478

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A098478

Expansion of 1/sqrt(1-2x-11x^2+12x^3).
(history; published version)

#15 by N. J. A. Sloane at Thu Jan 30 21:29:15 EST 2020

FORMULA

D-finite with recurrence: n*a(n) = (2*n-1)*a(n-1) + 11*(n-1)*a(n-2) - 6*(2*n-3)*a(n-3). - Vaclav Kotesovec, Jun 23 2014

Discussion

Thu Jan 30

21:29

OEIS Server: https://oeis.org/edit/global/2847

#14 by R. J. Mathar at Mon Jan 20 05:12:23 EST 2020

STATUS

editing

approved

#13 by R. J. Mathar at Mon Jan 20 05:12:19 EST 2020

FORMULA

RecurrenceD-finite: n*a(n) = (2*n-1)*a(n-1) + 11*(n-1)*a(n-2) - 6*(2*n-3)*a(n-3). - Vaclav Kotesovec, Jun 23 2014

STATUS

approved

editing

#12 by Vaclav Kotesovec at Mon Jun 23 15:36:12 EDT 2014

STATUS

proposed

approved

#11 by Michel Marcus at Mon Jun 23 13:35:18 EDT 2014

STATUS

editing

proposed

#10 by Michel Marcus at Mon Jun 23 13:35:12 EDT 2014

COMMENTS

1/sqrt(1-2x-(4r-1)x^2+4r^3) expands to give sum{k=0..floor(n/2), binomial(2k,k)binomial(n-k,n-2k)r^k}.

STATUS

proposed

editing

#9 by Vincenzo Librandi at Mon Jun 23 13:33:39 EDT 2014

STATUS

editing

proposed

#8 by Vincenzo Librandi at Mon Jun 23 13:33:30 EDT 2014

LINKS

Vincenzo Librandi, <a href="/A098478/b098478.txt">Table of n, a(n) for n = 0..200</a>

STATUS

approved

editing

#7 by Vaclav Kotesovec at Mon Jun 23 07:48:42 EDT 2014

STATUS

editing

approved

#6 by Vaclav Kotesovec at Mon Jun 23 07:48:32 EDT 2014

FORMULA

Recurrence: n*a(n) = (2*n-1)*a(n-1) + 11*(n-1)*a(n-2) - 6*(2*n-3)*a(n-3). - Vaclav Kotesovec, Jun 23 2014