Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054558
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054558 Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 9 1-simplexes. +0
1
150, 960, 3605, 10360, 25200, 54600, 108570, 201960, 356070, 600600, 975975, 1536080, 2351440, 3512880, 5135700, 7364400, 10377990, 14395920, 19684665, 26565000, 35420000, 46703800, 60951150, 78787800, 100941750, 128255400 (list; graph; listen)
OFFSET

5,1

COMMENT

Number of {T_1,T_2,...,T_k} where T_i,i=1..k are 3-subsets of an n-set such that {D | D is 2-subset of T_i for some i=1..k} has l elements; k=5,l=9.

REFERENCES

V. Jovovic, On the number of two-dimensional simplicial complexes (in Russian), Metody i sistemy tekhnicheskoy diagnostiki, Vypusk 16, Mezhvuzovskiy zbornik nauchnykh trudov, Izdatelstvo Saratovskogo universiteta, 1991.

FORMULA

a(n)=150*C(n, 5)+60*C(n, 6)+35*C(n, 7)=n*(n-1)*(n-2)*(n-3)*(n-4)*(n^2+n+150)/144

CROSSREFS

Cf. A054557.

Sequence in context: A008889 A063829 A140671 this_sequence A073614 A088361 A135968

Adjacent sequences: A054555 A054556 A054557 this_sequence A054559 A054560 A054561

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 10 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research