This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Andrew Howroyd, Table of n, a(n) for n = 1..100 C. G. Bower, Transforms (2) 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 Cf. A007549, A007561, A035079, A035080. Sequence in context: A151496 A202519 A192250 * A193257 A173193 A196323 Adjacent sequences:  A035078 A035079 A035080 * A035082 A035083 A035084 KEYWORD nonn,eigen AUTHOR Christian G. Bower, Nov 15 1998 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 December 5 17:42 EST 2019. Contains 329768 sequences. (Running on oeis4.)