login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049022 Recurring combinations: a(n) = C(a(n-1),a(n-2)). 2

%I

%S 2,4,6,15,5005,23197529289205687077586038842122627336104000

%N Recurring combinations: a(n) = C(a(n-1),a(n-2)).

%C The next term has 200700 digits. - _Harvey P. Dale_, Aug 14 2011

%t Transpose[NestList[{Last[#],Binomial[Last[#],First[#]]}&, {2,4}, 6]] [[1]] (* _Harvey P. Dale_, Aug 14 2011 *)

%K nonn,nice,easy

%O 0,1

%A _Floor van Lamoen_

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 May 14 16:48 EDT 2021. Contains 343898 sequences. (Running on oeis4.)