|
|
A035081
|
|
Number of increasing asymmetric rooted connected graphs where every block is a complete graph.
|
|
4
|
|
|
1, 1, 1, 7, 27, 167, 1451, 12672, 133356, 1573608, 20731512, 299642958, 4732486932, 81201040470, 1500094187292, 29730606352920, 628968809015766, 14147458062941100, 337143091156288002, 8485143902146640124
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
In an increasing rooted graph nodes are numbered and numbers increase as you move away from root.
|
|
LINKS
|
|
|
FORMULA
|
Shifts left when EGJ transform applied twice.
|
|
PROG
|
(PARI) EGJ(v)={Vec(serlaplace(prod(k=1, #v, (1 + x^k/k! + O(x*x^#v))^v[k]))-1, -#v)}
seq(n)={my(v=[1]); for(n=2, n, v=concat([1], EGJ(EGJ(v)))); v} \\ Andrew Howroyd, Sep 11 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,eigen
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|