The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A014532

Form array in which n-th row is obtained by expanding (1+x+x^2)^n and taking the 3rd column from the center.
(history; published version)

#76 by Peter Luschny at Thu Sep 05 14:34:12 EDT 2024

STATUS

proposed

approved

#75 by Michel Marcus at Thu Sep 05 14:29:08 EDT 2024

STATUS

editing

proposed

#74 by Michel Marcus at Thu Sep 05 14:29:05 EDT 2024

FORMULA

a(n) = sum_Sum_{i=0}^..floor((n-1)/2) } binomial(n+2,n-1-i) * binomial(n-1-i,i). - Shanzhen Gao, Apr 20 2010

STATUS

proposed

editing

#73 by Michael De Vlieger at Thu Sep 05 14:18:49 EDT 2024

STATUS

editing

proposed

#72 by Michael De Vlieger at Thu Sep 05 14:18:42 EDT 2024

LINKS

Mark Shattuck, <a href="https://doi.org/10.54550/ECA2024V4S3R32ECA2024V4S4R32">Subword Patterns in Smooth Words</a>, Enum. Comb. Appl. (2024) Vol. 4, No. 4, Art. No. S2R32. See p. 10.

STATUS

proposed

editing

#71 by Michael De Vlieger at Thu Sep 05 14:16:58 EDT 2024

STATUS

editing

proposed

#70 by Michael De Vlieger at Thu Sep 05 14:16:54 EDT 2024

LINKS

Mark Shattuck, <a href="https://doi.org/10.54550/ECA2024V4S3R32">Subword Patterns in Smooth Words</a>, Enum. Comb. Appl. (2024) Vol. 4, No. 4, Art. No. S2R32. See p. 10.

STATUS

approved

editing

#69 by R. J. Mathar at Mon Aug 01 09:41:40 EDT 2022

STATUS

editing

approved

#68 by R. J. Mathar at Mon Aug 01 09:41:35 EDT 2022

FORMULA

Conjecture: D-finite with recurrence -(n+5)*(n-1)*a(n) +(n+2)*(2*n+3)*a(n-1) +3*(n+2)*(n+1)*a(n-2)=0. - R. J. Mathar, Dec 02 2012

STATUS

approved

editing

#67 by OEIS Server at Tue Feb 28 22:28:37 EST 2017

LINKS

G. C. Greubel, <a href="/A014532/b014532_1.txt">Table of n, a(n) for n = 1..1000</a> (terms 0..200 from T. D. Noe)