This site is supported by donations to The OEIS 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!)
 A032290 Number of dyslexic rooted compound windmills with n nodes and leaves of 2 colors. 1
 2, 2, 5, 13, 38, 115, 377, 1267, 4446, 15970, 58741, 219765, 834779, 3208732, 12461304, 48809233, 192596729, 764814458, 3054101548, 12255774481, 49396159564, 199867069373, 811554088996, 3305812070784 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..200 FORMULA Shifts left under "DIK" (bracelet, indistinct, unlabeled) transform. PROG (PARI) DIK(p, n)={(sum(d=1, n, eulerphi(d)/d*log(subst(1/(1+O(x*x^(n\d))-p), x, x^d))) + ((1+p)^2/(1-subst(p, x, x^2))-1)/2)/2} seq(n)={my(p=O(1)); for(i=1, n, p=2+DIK(x*p, i)); Vec(p)} \\ Andrew Howroyd, Jun 20 2018 CROSSREFS Sequence in context: A019083 A029856 A072898 * A032201 A268180 A268003 Adjacent sequences:  A032287 A032288 A032289 * A032291 A032292 A032293 KEYWORD nonn AUTHOR 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 20 14:40 EST 2019. Contains 319333 sequences. (Running on oeis4.)