login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037953 C(n,[ (n-5)/2 ]). 3
0, 0, 0, 0, 0, 1, 1, 7, 8, 36, 45, 165, 220, 715, 1001, 3003, 4368, 12376, 18564, 50388, 77520, 203490, 319770, 817190, 1307504, 3268760, 5311735, 13037895, 21474180, 51895935, 86493225, 206253075 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

LINKS

Table of n, a(n) for n=0..31.

FORMULA

a(n) = binomial(n, A004526(n-5)). - Wesley Ivan Hurt, Nov 28 2013

Conjecture: -(n+6)*(n-5)*a(n) +2*(n)*a(n-1) +4*(n-1)*n*a(n-2)=0. - R. J. Mathar, Jul 26 2015

MAPLE

A037953:=n->binomial(n, floor((n-5)/2)); seq(A037953(n), n=0..50); # Wesley Ivan Hurt, Nov 28 2013

MATHEMATICA

Table[Binomial[n, Floor[(n-5)/2]], {n, 0, 40}] (* Harvey P. Dale, Oct 11 2012 *)

CROSSREFS

Cf. A004526.

Sequence in context: A154745 A048064 A122605 * A296636 A041106 A303732

Adjacent sequences:  A037950 A037951 A037952 * A037954 A037955 A037956

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

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 October 14 04:44 EDT 2019. Contains 327995 sequences. (Running on oeis4.)