login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263343 Triangle read by rows: T(n,k) is the number of graphs with n vertices containing exactly k non-isomorphic subgraphs. 0
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 0, 1, 0, 1, 1, 1, 1, 2, 2, 3, 1, 2, 3, 0, 1, 2, 3, 1, 0, 0, 1, 0, 3, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 2, 3, 3, 3, 3, 4, 1, 4, 4, 6, 1, 1, 1, 3, 1, 7, 1, 4, 1, 5, 2, 1, 2, 4, 0, 2, 2, 1, 1, 1, 3, 3, 2, 1, 3, 0, 0, 1, 1, 0, 2, 1, 2, 0, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,10

COMMENTS

Row sums give A000088, n >= 1.

LINKS

Table of n, a(n) for n=1..100.

FindStat - Combinatorial Statistic Finder, The number of subgraphs.

EXAMPLE

Triangle begins:

1,

1,1,

1,1,1,1,

1,1,2,2,1,1,0,1,0,1,1,

1,1,2,2,3,1,2,3,0,1,2,3,1,0,0,1,0,3,0,1,0,1,1,0,1,0,0,1,0,0,1,0,1,1,

...

CROSSREFS

Cf. A000088.

Sequence in context: A090477 A293019 A087479 * A326413 A329171 A326918

Adjacent sequences:  A263340 A263341 A263342 * A263344 A263345 A263346

KEYWORD

nonn,tabf

AUTHOR

Christian Stump, Oct 15 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 12:04 EST 2020. Contains 338947 sequences. (Running on oeis4.)