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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324239 Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)). 2
 1, 0, 1, 0, 2, 0, 4, 2, 0, 11, 10, 0, 34, 76, 2, 0, 156, 682, 15, 0, 1044, 9864, 207, 2, 0, 12346, 245518, 3197, 19, 0, 274668, 11366961, 74614, 326, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Eric Weisstein's World of Mathematics, Graph Radius Wikipedia, Distance (graph theory) EXAMPLE Triangle begins:   1;   0,      1;   0,      2;   0,      4,        2;   0,     11,       10;   0,     34,       76,     2;   0,    156,      682,    15;   0,   1044,     9864,   207,   2;   0,  12346,   245518,  3197,  19;   0, 274668, 11366961, 74614, 326, 2;   ... CROSSREFS Row sums give A001349. Columns k=1..2 are A000088(n-1), A324061. Cf. A283826, A294522, A294525, A324244. Sequence in context: A293815 A339941 A211318 * A274706 A037035 A159984 Adjacent sequences:  A324236 A324237 A324238 * A324240 A324241 A324242 KEYWORD nonn,tabf,more AUTHOR Andrew Howroyd, Sep 02 2019 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.

Last modified April 18 14:58 EDT 2021. Contains 343089 sequences. (Running on oeis4.)