The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185634 Number of n-length cycles from any point in a complete graph on n nodes. 1
 1, 2, 21, 204, 2605, 39990, 720601, 14913080, 348678441, 9090909090, 261535698061, 8230246567620, 281241170407093, 10371206370520814, 410525522232055665, 17361641481138401520, 781282469559318055057, 37275544492386193492506, 1879498672877297909667781 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS If M is the n X n matrix filled with ones, a(n) is the upper left element of (M-Id)^n LINKS Table of n, a(n) for n=2..20. FORMULA a(n) = floor((n-1)^n/n) + ((-1)^n+1)/2 a(n) = floor((n-1)^n/n)+1 for n odd, a(n) = floor((n-1)^n/n) for n even. EXAMPLE In a complete graph in 5 nodes, there are 204 different cycles with a length of 5, from a point to itself. CROSSREFS Cf. A173499. Sequence in context: A329553 A365061 A110253 * A077249 A068070 A085953 Adjacent sequences: A185631 A185632 A185633 * A185635 A185636 A185637 KEYWORD easy,nonn AUTHOR Sébastien Dumortier, Dec 18 2012 STATUS approved

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

Last modified December 10 15:23 EST 2023. Contains 367713 sequences. (Running on oeis4.)