Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063016
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063016 Product of Catalan(n) and (2^(n+1) -1). +0
2
1, 3, 14, 75, 434, 2646, 16764, 109395, 730730, 4973826, 34381412, 240728670, 1703826292, 12170930700, 87633375480, 635351667075, 4634365164570, 33985474184970, 250419761106900, 1853107999454250, 13765951702923420 (list; graph; listen)
OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,200

FORMULA

a(n) = Catalan(n)*(2^(n+1)-1); a(n) = 2 (2 n - 3) (3 (n - 1) a(n-1) - 4 (2 n - 5) a(n-2))/( n (n - 1)); o.g.f: (sqrt(1-4x) - sqrt(1-8x))/2.

PROGRAM

(PARI) { for (n=0, 200, a=(2^(n + 1) - 1)*binomial(2*n, n)/(n + 1); write("b063016.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 16 2009]

CROSSREFS

Cf. A000108, A063017.

Sequence in context: A074549 A126122 A026004 this_sequence A133798 A100937 A048779

Adjacent sequences: A063013 A063014 A063015 this_sequence A063017 A063018 A063019

KEYWORD

easy,nonn

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com), Jul 04 2001

EXTENSIONS

Initial term 0 removed by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 16 2009

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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research