login
This site is supported by donations to The OEIS 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
2, 4, 6, 15, 5005, 23197529289205687077586038842122627336104000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

The next term has 200700 digits. - Harvey P. Dale, Aug 14 2011

LINKS

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

MATHEMATICA

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

CROSSREFS

Sequence in context: A217525 A295615 A127679 * A209867 A136033 A099315

Adjacent sequences:  A049019 A049020 A049021 * A049023 A049024 A049025

KEYWORD

nonn,nice,easy

AUTHOR

Floor van Lamoen

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 January 20 23:20 EST 2019. Contains 319343 sequences. (Running on oeis4.)