Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140462
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140462 Turan's upper bound on the number of triangles of a simplicial complex of dimension two for which every minimal non-face has three vertices. +0
1
0, 0, 0, 1, 3, 7, 14, 23, 36, 54, 75, 102, 136, 174, 220, 275, 335, 405, 486, 573, 672, 784, 903, 1036, 1184, 1340, 1512 (list; graph; listen)
OFFSET

0,5

COMMENT

Conjecture 1.2, p. 2 of Frohmader.

REFERENCES

P. Turan, Research Problem, Kozl MTA Mat. Kutato Int. 6(1961)417-423.

LINKS

Andrew Frohmader, More Constructions for Turan's (3, 4)-Conjecture

FORMULA

a(n) = (5/2)*(k^3) - (3/2)*(k^2) if n = 3*k; (5/2)*(k^3) + (k^2) - (1/2)*k if n = 3*k+1; (5/2)*(k^3) + (7/2)*(k^2) + k if n = 3*k+2.

CROSSREFS

Sequence in context: A146931 A115285 A004232 this_sequence A093523 A123386 A060999

Adjacent sequences: A140459 A140460 A140461 this_sequence A140463 A140464 A140465

KEYWORD

easy,more,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 27 2008

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research