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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032218 Number of dyslexic rooted compound windmills with n nodes where any 2 submills extending from the same node are different sizes. 1
 1, 1, 1, 2, 3, 6, 12, 25, 51, 111, 244, 543, 1219, 2783, 6352, 14763, 34208, 80271, 188517, 446696, 1057534, 2527328, 6029096, 14488609, 34792504, 84059268, 202861050, 492369844, 1193743829, 2907834039, 7078295983, 17300759883, 42248522887, 103574837980 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..200 FORMULA Shifts left under "DFK" (bracelet, size, unlabeled) transform. PROG (PARI) DFK(v)={apply(p->subst(serlaplace(p/y + polcoeff(p, 1) + polcoeff(p, 2)), y, 1)/2, Vec(-1 + prod(k=1, #v, 1 + v[k]*x^k*y + O(x*x^#v)), -#v))} seq(n)={my(v=[1]); for(i=2, n, v=concat([1], DFK(v))); v} \\ Andrew Howroyd, Sep 20 2018 CROSSREFS Sequence in context: A077903 A038086 A032305 * A005829 A038087 A116379 Adjacent sequences:  A032215 A032216 A032217 * A032219 A032220 A032221 KEYWORD nonn AUTHOR EXTENSIONS Terms a(32) and beyond from Andrew Howroyd, Sep 20 2018 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 January 17 20:36 EST 2020. Contains 330987 sequences. (Running on oeis4.)