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!)
A026030 a(n) = T(2n,n-1), where T is defined in A026022. 0

%I #30 Jun 15 2014 17:13:45

%S 1,4,15,56,209,780,2912,10880,40698,152456,572033,2150040,8095425,

%T 30535260,115377660,436698240,1655607390,6286707000,23908446510,

%U 91057063344,347281885818,1326262602104,5071418015120,19415851639296,74419447792340

%N a(n) = T(2n,n-1), where T is defined in A026022.

%C a(n) = number of (s(0), s(1), ..., s(2n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 3, s(2n) = 5.

%F a(n) = C(2n, n-1) - C(2n, n-5). G.f.: (1+x^2C^4)*C^4, where C=(1-sqrt(1-4x))/(2x). - _Ralf Stephan_, Jan 09 2005

%F G.f.: 2*x*(1-2*x) / ((1-2*x)*(1-4*x+x^2) + (1-x)*(1-3*x)*sqrt(1-4*x)). - _Michael Somos_, Jan 08 2012

%F Conjecture: (n+5)*a(n) -2*(5*n+16)*a(n-1) +(35*n+47)*a(n-2) +2*(-25*n+14)*a(n-3) +12*(2*n-5)*a(n-4)=0. - _R. J. Mathar_, Jun 15 2014

%e x + 4*x^2 + 15*x^3 + 56*x^4 + 209*x^5 + 780*x^6 + 2912*x^7 + 10880*x^8 + ...

%o (PARI) {a(n) = binomial( 2*n, n-1) - binomial( 2*n, n-5)} /* _Michael Somos_, Jan 08 2012 */

%Y Cf. A001075.

%K nonn

%O 1,2

%A _Clark Kimberling_

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 April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)