Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A011894
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A011894 [ n(n-1)(n-2)/12 ]. +0
1
0, 0, 0, 0, 2, 5, 10, 17, 28, 42, 60, 82, 110, 143, 182, 227, 280, 340, 408, 484, 570, 665, 770, 885, 1012, 1150, 1300, 1462, 1638, 1827, 2030, 2247, 2480, 2728, 2992, 3272, 3570, 3885, 4218, 4569, 4940 (list; graph; listen)
OFFSET

0,5

COMMENT

a(n+1)=floor[(n^3-n)/12] is an upper bound for the Kirchhoff index of a circulant graph with n vertices [Zhang&Yang] - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 26 2007

LINKS

H. Zhang and Y. Yang, Resistance Distance and Kirchhoff Index in Circulant Graphs, Int. J. Quant. Chem. 107 (2007) 330-339.

MAPLE

seq(floor(binomial(n, 3)/2), n=0..40); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 12 2009]

CROSSREFS

Sequence in context: A056871 A007504 A049688 this_sequence A071602 A046485 A109377

Adjacent sequences: A011891 A011892 A011893 this_sequence A011895 A011896 A011897

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Removed duplicate of the Maple program - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 25 2009

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