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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A011828 Number of f-vectors for simplicial complexes of dimension at most 3 on at most n-1 vertices. 3
2, 3, 5, 10, 26, 95, 457, 2246, 9705, 35926, 115688, 331201, 859587, 2054860, 4582126, 9627831, 19217260, 36679253, 67308375, 119286676, 204940824, 342425909, 557944719, 888630900, 1386246251, 2121866592, 3191757298 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3 (p. 743).

S. Linusson, The number of M-sequences and f-vectors, Combinatorica, 19 (1999), 255-266.

FORMULA

a(n+1) = (12*n^10 -112*n^9 +351*n^8 -132*n^7 +378*n^6 -2856*n^5 +4839*n^4 +56812*n^3 -5580*n^2 +309168*n +725760)/362880 fits terms up to 3191757298. [Frank Ellermann (hmdmhdfmhdjmzdtjmzdtzktdkztdjz(AT)gmail.com)]

CROSSREFS

Cf. A011827, A007695.

Sequence in context: A011827 A135961 A173253 * A011829 A011830 A011831

Adjacent sequences:  A011825 A011826 A011827 * A011829 A011830 A011831

KEYWORD

nonn

AUTHOR

Svante Linusson (linusson(AT)math.kth.se)

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 21:27 EST 2012. Contains 205859 sequences.