|
|
A243332
|
|
Number of simple connected graphs with n nodes that are integral and triangle-free.
|
|
1
|
|
|
1, 1, 0, 1, 1, 3, 1, 3, 0, 14, 8, 18, 33, 75
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
LINKS
|
|
|
FORMULA
|
(Sage) a243332 = lambda n: sum(1 for g in graphs.nauty_geng(f'-c -t {n}') if sum(m for _,m in g.charpoly().roots(ZZ))==n) # Max Alekseyev, Jan 31 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|