Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006291
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006291 Pseudo-bricks with n nodes.
(Formerly M4450)
+0
3
1, 7, 88, 1731, 55094, 2806539 (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. A006292, A006293.

Sequence in context: A137143 A069430 A020564 this_sequence A054678 A036902 A142204

Adjacent sequences: A006288 A006289 A006290 this_sequence A006292 A006293 A006294

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research