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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263322 Triangle read by rows: T(n,k) is the number of graphs with n vertices and burning number k. 0
1, 2, 3, 1, 8, 2, 1, 23, 9, 1, 1, 94, 56, 4, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row sums give A000088, n >= 1.

LINKS

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

FindStat - Combinatorial Statistic Finder, The burning number of a graph.

EXAMPLE

Triangle begins:

1,

2,

3,1,

8,2,1,

23,9,1,1,

94,56,4,1,1,

...

CROSSREFS

Cf. A000088.

Sequence in context: A109198 A081320 A147865 * A266614 A175314 A331123

Adjacent sequences:  A263319 A263320 A263321 * A263323 A263324 A263325

KEYWORD

nonn,tabf,more

AUTHOR

Christian Stump, Oct 14 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 March 30 19:49 EDT 2020. Contains 333127 sequences. (Running on oeis4.)