Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024607
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024607 Number of connected triangle-free graphs on n unlabeled nodes. +0
3
1, 1, 1, 3, 6, 19, 59, 267, 1380, 9832, 90842, 1144061, 19425052, 445781050, 13743625184 (list; graph; listen)
OFFSET

1,4

LINKS

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

Eric Weisstein's World of Mathematics, Triangle-Free Graph

CROSSREFS

Inverse Euler transform of A006785.

Sequence in context: A148571 A148572 A052393 this_sequence A058818 A081181 A062164

Adjacent sequences: A024604 A024605 A024606 this_sequence A024608 A024609 A024610

KEYWORD

hard,nonn,nice

AUTHOR

Peter J. Cameron (p.j.cameron(AT)qmw.ac.uk)

EXTENSIONS

2 more terms from Vladeta Jovovic (vladeta(AT)eunet.rs), May 17 2008

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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research