Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112850
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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

FORMULA

|End(C_2n)| = 2n*(2+binomial(2n-1, n-1)+binomial(2n-1, n))

CROSSREFS

Cf. A112849.

Adjacent sequences: A112847 A112848 A112849 this_sequence A112851 A112852 A112853

Sequence in context: A088658 A088802 A123854 this_sequence A113154 A083299 A018215

KEYWORD

easy,nonn

AUTHOR

Martin Alexander Michels (martinmichels(AT)t-online.de), Sep 24 2005

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research