|
Search: id:A112850
|
|
|
| A112850 |
|
Number of graph endomorphisms of undirected cycles of even length: |End(C_2n)|. |
|
+0
2
|
|
| 4, 32, 132, 576, 2540, 11112, 48076, 205952, 875196, 3695160, 15519548, 64899792, 270415652, 1123264856
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
M. A. Michels, About The Structure of Graph Endomorphisms, Diploma thesis, University of Oldenburg, Germany, 2005
M. A. Michels and U. Knauer, The congruence classes of paths and cycles, Discrete Math., 309 (2009), 5352-5359. [From N. J. A. Sloane, Sep 15 2009]
|
|
FORMULA
|
|End(C_2n)| = 2n*(2+binomial(2n-1, n-1)+binomial(2n-1, n))
|
|
CROSSREFS
|
Cf. A112849.
Sequence in context: A088658 A088802 A123854 this_sequence A113154 A083299 A018215
Adjacent sequences: A112847 A112848 A112849 this_sequence A112851 A112852 A112853
|
|
KEYWORD
|
easy,nonn,more
|
|
AUTHOR
|
Martin Alexander Michels (martinmichels(AT)t-online.de), Sep 24 2005
|
|
|
Search completed in 0.002 seconds
|
