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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005194 Number of balanced symmetric graphs.
(Formerly M1017)
1
1, 2, 4, 6, 10, 22, 38, 102, 182, 574, 1070, 3798, 7286, 28894, 57374, 248502, 506678, 2384254, 5007230, 25247958, 54311126, 292500574, 645652574, 3680048502, 8301671798, 49967727934, 115334270270, 728281984278, 1714641313046, 11341092707614 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
David A. Sheppard, The factorial representation of balanced labelled graphs, Discrete Math. 15 (1976), no. 4, 379-388.
FORMULA
Let S(n,j) = j! * j^floor((n-2)/2). If n is even, then a(n) = 2 * Sum_{j=1..n/2} S(n,j). If n is odd, and (n-1)/2 is odd, then a(n) = ((n+1)/2)! + 2 * Sum_{j=1,3,5,...,(n-1)/2} S(n, j). Otherwise, n is odd, and (n-1)/2 is even, then a(n) = ((n+1)/2)! + ((n-1)/2)! + 2 * Sum_{j=1,3,5,...,(n-1)/2-1} S(n, j) [From Sheppard paper]. - Sean A. Irvine, Apr 18 2016
CROSSREFS
Sequence in context: A293281 A164143 A095007 * A171447 A207667 A085809
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Apr 18 2016
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:41 EDT 2024. Contains 371970 sequences. (Running on oeis4.)