Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135756
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135756 a(n) = Sum_{k=0..n} C(n,k)*2^[k*(k-1)]. +0
2
1, 2, 7, 80, 4381, 1069742, 1080096067, 4405584869660, 72092808533798521, 4723015159635987920282, 1237987266193328694390243007, 1298087832233881093828346620725800 (list; graph; listen)
OFFSET

0,2

PROGRAM

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

CROSSREFS

Cf. variants: A006896, A135755.

Sequence in context: A042791 A128293 A071409 this_sequence A111822 A062764 A163855

Adjacent sequences: A135753 A135754 A135755 this_sequence A135757 A135758 A135759

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research