login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054648 Number of labeled pure 2-complexes on n nodes (0-simplexes) with 4 2-simplexes and 11 1-simplexes. 0
360, 13230, 137760, 835380, 3679200, 13056120, 39584160, 106383420, 259819560, 586936350, 1242521280, 2489618040, 4758324480, 8728907040, 15446635200, 26477304840, 44114190120, 71649152190, 113722852320, 176771479500 (list; graph; refs; listen; history; internal format)
OFFSET

6,1

COMMENTS

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=4,l=11.

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)=360*C(n, 6)+10710*C(n, 7)+42000*C(n, 8)+41580*C(n, 9)+12600*C(n, 10)=n*(n-1)*(n-2)*(n-3)*(n-4)*(n-5)*(n^4+3*n^3-58*n^2-120*n+1008)/288.

CROSSREFS

Cf. A054557-A054562.

Sequence in context: A056322 A056313 A192829 * A166785 A200210 A145412

Adjacent sequences:  A054645 A054646 A054647 * A054649 A054650 A054651

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:15 EST 2012. Contains 205694 sequences.