login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032289 Number of dyslexic rooted compound windmills with n nodes. 2

%I #12 Jun 20 2018 22:14:25

%S 1,1,2,4,9,20,49,119,305,790,2100,5648,15449,42664,119128,335310,

%T 951119,2714974,7795211,22493655,65202995,189767806,554326057,

%U 1624572250,4775504516,14076385819,41596613660,123206155126

%N Number of dyslexic rooted compound windmills with n nodes.

%H Andrew Howroyd, <a href="/A032289/b032289.txt">Table of n, a(n) for n = 1..200</a>

%H <a href="/index/Mo#mobiles">Index entries for sequences related to mobiles</a>

%F Shifts left under "DIK" (bracelet, indistinct, unlabeled) transform.

%o (PARI)

%o 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}

%o seq(n)={my(p=O(1));for(i=1, n, p=1+DIK(x*p, i)); Vec(p)} \\ _Andrew Howroyd_, Jun 20 2018

%Y Cf. A038038.

%K nonn,eigen

%O 1,3

%A _Christian G. Bower_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)