login
A307871
Number of (undirected) paths in the n-odd graph.
0
0, 6, 1365, 210541386790
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Graph Path
Eric Weisstein's World of Mathematics, Odd Graph
EXAMPLE
O_1 is K_1 which has no edges, so a(1) = 0.
O_2 is K_3 which has 3 undirected paths of length one and 3 of length two, so a(2) = 6.
O_3 is the Petersen graph with path polynomial P(x) = 15*x + 30*x^2 + 60*x^3 + 120*x^4 + 180*x^5 + 240*x^6 + 300*x^7 + 300*x^8 + 120*x^9, so a(3) = P(1) = 1365.
CROSSREFS
Sequence in context: A172625 A066037 A279924 * A195646 A265473 A199645
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, May 02 2019
STATUS
approved