Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136636
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136636 a(n) = n * C(2*3^(n-1), n) for n>=1. +0
4
2, 30, 2448, 1265004, 4368213360, 106458751541142, 19173684851378353296, 26413015283743616538733008, 285290979402099025600644272168880, 24601033850235942230699563821233785600080 (list; graph; listen)
OFFSET

1,1

COMMENT

Equals column 1 of triangle A136635.

PROGRAM

(PARI) {a(n)=n*binomial(2*3^(n-1), n)}

CROSSREFS

Cf. A136635 (triangle), A014070 (main diagonal), A136393 (column 0), A136637 (row sums), A136638 (antidiagonal sums).

Sequence in context: A132104 A099800 A099929 this_sequence A030249 A000187 A053851

Adjacent sequences: A136633 A136634 A136635 this_sequence A136637 A136638 A136639

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu) and Paul D. Hanna (pauldhanna(AT)juno.com), Jan 15 2008

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 3 10:07 EST 2008. Contains 151162 sequences.


AT&T Labs Research