Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054557
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054557 Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 10 1-simplexes. +0
8
72, 4824, 32256, 127008, 378000, 940464, 2062368, 4115232, 7629336, 13333320, 22198176, 35485632, 54800928, 82149984, 120000960, 171350208, 239792616, 329596344, 445781952, 594205920, 781648560, 1015906320, 1305888480 (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=10.

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)=72*C(n, 5)+4392*C(n, 6)=n*(n-1)*(n-2)*(n-3)*(n-4)*(61*n-299)/10.

CROSSREFS

Sequence in context: A111598 A116312 A111782 this_sequence A103861 A119750 A093272

Adjacent sequences: A054554 A054555 A054556 this_sequence A054558 A054559 A054560

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 10 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 11 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research