Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007342
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007342 Complexity of a 2 X n grid.
(Formerly M3502)
+0
1
1, 4, 15, 59, 209, 780 (list; graph; listen)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

G. Kreweras, Complexite et circuits Euleriens dans la sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.

CROSSREFS

Sequence in context: A160156 A102052 A128714 this_sequence A017951 A129155 A070071

Adjacent sequences: A007339 A007340 A007341 this_sequence A007343 A007344 A007345

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Probably an erroneous version of A001353.

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research