Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
The OEIS is supported by the many generous donors to the OEIS Foundation.
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 A343019
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 WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified September 28 15:06 EDT 2024. Contains 376297 sequences.
License Agreements, Terms of Use, Privacy Policy