This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A192835 Molecular topological indices of the odd graphs. 2
 0, 24, 540, 12040, 258300, 5258484, 102834732, 1948929840, 36099037260, 656717973340, 11782163004612, 208991112900024, 3673025551895700, 64051241252342400, 1109647124772841800, 19114937411113617120, 327669959548309223340, 5592728044559732561100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The n-odd graph is a vertex transitive graph. The number of nodes at distance k from a specified node for k in 1..n-1 is given by A088459(n,k). Ignore the second half of each row (k>=n). - Andrew Howroyd, May 11 2017 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..100 Eric Weisstein's World of Mathematics, Molecular Topological Index Eric Weisstein's World of Mathematics, Odd Graph FORMULA a(n) = binomial(2*n-1, n)*n * (n + Sum_{k=1..n-1} k*A088459(n,k)) for n>1. - Andrew Howroyd, May 11 2017 MATHEMATICA b[n_] := Sum[Binomial[n-1, i]*Binomial[n, i]*Min[2*i, 2*(n-i)-1], {i, 1, n - 1}]; a[1] = 0; a[n_] := Binomial[2*n - 1, n]*n*(n + b[n]); Array[a, 18] (* Jean-François Alcover, Oct 02 2017, after Andrew Howroyd *) PROG (PARI) b(n)=sum(i=1, n-1, binomial(n-1, i)*binomial(n, i)*min(2*i, 2*(n-i)-1)); a(n)=if(n<2, 0, binomial(2*n-1, n)*n*(n+b(n))); \\ Andrew Howroyd, May 11 2017 CROSSREFS Cf. A088459. Sequence in context: A014907 A233636 A121905 * A235118 A223099 A187671 Adjacent sequences:  A192832 A192833 A192834 * A192836 A192837 A192838 KEYWORD nonn AUTHOR Eric W. Weisstein, Jul 11 2011 EXTENSIONS a(8)-a(18) from Andrew Howroyd, May 11 2017 STATUS approved

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

Last modified November 12 19:19 EST 2018. Contains 317116 sequences. (Running on oeis4.)