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!)
 A007167 Number of skeins with 2n+1 edges. (Formerly M3504) 0

%I M3504

%S 1,1,4,15,62,271,1247,5938,29113,145815,743384,3844314,20118681,

%T 106348391,567002169,3045455865,16463622763,89509216860,489103356753,

%U 2684663659765,14795752770278,81841297482116,454202999050433,2528381760697852

%N Number of skeins with 2n+1 edges.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H R. C. Read, <a href="http://dx.doi.org/10.1007/BF02188172">On the enumeration of a class of plane multigraphs</a>, Aequat. Math. 31 (1986) no 1, 47-63.

%o (PARI) { s =y ; for(loop=1,18, p = 1 ; forstep(i= 1,2*loop-1,2, sigmai = polcoeff(s,i,y) ; if(i==2*loop-1, print1(sigmai,",") ; ) ; n=0 ; tmp = 0 ; while(i*n <=2*loop-1, ff = 1 ; for(k=1,n, ff *= (-sigmai-k+1)/k ; ) ; tmp += ff*(-y)^(i*n) ; n++ ; ) ; p *= tmp : ) ; b = y-s ; forstep(i=1,2*loop-1,2, b += polcoeff(p,i,y)*y^i ; ) ; s = y ; for(r=0,loop-1, for(i=0,2*loop+1, s += polcoeff(b^(3+2*r),i,y)*y^i ; ) ; ) ; ) ; } \\ _R. J. Mathar_, Apr 24 2006

%K nonn

%O 0,3

%A _N. J. A. Sloane_

%E More terms from _R. J. Mathar_, Apr 24 2006

%E More terms from _Sean A. Irvine_, Nov 07 2017

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 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)