Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054644
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054644 Number of labeled pure 2-complexes on n nodes with 3 2-simplexes. +0
1
4, 120, 1140, 6545, 27720, 95284, 280840, 735130, 1750540, 3858140, 7971964, 15596035, 29112720, 52174360, 90223760, 151173044, 246274580, 391222160, 607525380, 924205205, 1379864024, 2025189100, 2925954200, 4166590350 (list; graph; listen)
OFFSET

4,1

FORMULA

a(n)=binomial(binomial(n, 3), 3)=4*binomial(n, 4)+100*binomial(n, 5)+480*binomial(n, 6)+945*binomial(n, 7)+840*binomial(n, 8)+280*binomial(n, 9)=n*(n-1)*(n-2)*(n-3)*(n^2+2)*(n^3-3*n^2+2*n-12)/1296.

CROSSREFS

Cf. A054563.

Sequence in context: A146508 A096464 A064204 this_sequence A006434 A002702 A068204

Adjacent sequences: A054641 A054642 A054643 this_sequence A054645 A054646 A054647

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 15 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 16 2000

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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research