Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006293
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006293 Pseudo-bricks with n nodes.
(Formerly M4015)
+0
3
1, 5, 56, 945, 28569, 1421360 (list; graph; listen)
OFFSET

4,2

REFERENCES

Walsh, T. R. S.; Counting unlabeled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B 32 (1982), no. 1, 12-32.

LINKS

Index entries for sequences related to bricks

CROSSREFS

Cf. A006291, A006292.

Sequence in context: A030060 A073563 A006658 this_sequence A132618 A060080 A076455

Adjacent sequences: A006290 A006291 A006292 this_sequence A006294 A006295 A006296

KEYWORD

nonn

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research