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!)
A135965 a(n) = binomial(floor(n*(1+sqrt(2))),n) for n>=0. 3

%I #14 Sep 08 2022 08:45:32

%S 1,2,6,35,126,792,3003,11440,75582,293930,1961256,7726160,30421755,

%T 206253075,818809200,5567902560,22239974430,151584480450,608359048206,

%U 2438362177020,16735679449896,67327446062800,462525733568080

%N a(n) = binomial(floor(n*(1+sqrt(2))),n) for n>=0.

%H G. C. Greubel, <a href="/A135965/b135965.txt">Table of n, a(n) for n = 0..1000</a>

%t Table[Binomial[Floor[n*(1+Sqrt[2])],n],{n,0,30}] (* _Harvey P. Dale_, Aug 25 2015 *)

%o (PARI) a(n)=binomial(floor(n*(1+sqrt(2))),n)

%o (Magma) [Binomial(Floor(n*(1+Sqrt(2))), n): n in [0..30]]; // _G. C. Greubel_, Aug 17 2018

%Y Cf. A135964.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Dec 11 2007

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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)