Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135759
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135759 Least Catalan number divisible by 2^n: a(n) = A000108(2^n-1). +0
2
1, 2, 132, 2674440, 3814986502092304, 24139737743045626825711458546273312, 2861304849265668492891140780463352404986232263244287143198790516197234752 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = C(2^(n+2)-4, 2^(n+1)-2) / (2^(n+1)-1). a(n)/2^n = A038003(n).

PROGRAM

(PARI) a(n)=binomial(2^(n+2)-4, 2^(n+1)-2)/(2^(n+1)-1)

CROSSREFS

Cf. A038003 (odd Catalan numbers).

Sequence in context: A131931 A020524 A099682 this_sequence A014315 A097641 A065963

Adjacent sequences: A135756 A135757 A135758 this_sequence A135760 A135761 A135762

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 02 2007

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research