Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049022
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049022 Recurring combinations: a(n) = C(a(n-1),a(n-2)). +0
3
2, 4, 6, 15, 5005, 23197529289205687077586038842122627336104000 (list; graph; listen)
OFFSET

0,1
CROSSREFS

Sequence in context: A077639 A039791 A127679 this_sequence A136033 A099315 A005179

Adjacent sequences: A049019 A049020 A049021 this_sequence A049023 A049024 A049025

KEYWORD

nonn,nice,easy

AUTHOR

Floor van Lamoen (fvlamoen(AT)hotmail.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.