Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020880
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020880 Number of strong elementary edge-subgraphs in Moebius ladder M_n. +0
1
6, 21, 26, 81 (list; graph; listen)
OFFSET

2,1
REFERENCES

J. P. McSorley, Counting structures in the Moebius ladder, Discrete Math., 184 (1998), 137-164.

CROSSREFS

Adjacent sequences: A020877 A020878 A020879 this_sequence A020881 A020882 A020883

Sequence in context: A064929 A102993 A143416 this_sequence A046467 A132184 A143322

KEYWORD

nonn,easy,more

AUTHOR

njas

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 October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.