Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135755
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135755 a(n) = Sum_{k=0..n} C(n,k)*3^[k*(k-1)/2]. +0
2
1, 2, 6, 40, 860, 63000, 14714728, 10562062112, 22960880409360, 150300904214651680, 2955814683617734854752, 174481716707875308905153664, 30905247968182392588500030233024 (list; graph; listen)
OFFSET

0,2

PROGRAM

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

CROSSREFS

Cf. variants: A006896, A135756.

Sequence in context: A081471 A133939 A045846 this_sequence A051185 A118623 A000612

Adjacent sequences: A135752 A135753 A135754 this_sequence A135756 A135757 A135758

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 27 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research