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!)
A062038 Triangular array T(n,k) giving number of alternating link diagrams with n >= 0 crossings, k = 0..[n/2] connected components and two external legs. 4

%I #3 Mar 30 2012 16:49:06

%S 1,2,8,1,42,12,260,114,4,1796,1030,90,13396,9290,1349,22,105706,84840,

%T 17220,728,870772,787082,203568,14884,140,7420836,7415814,2312094,

%U 244908,6120,65004584,70867212,25691670,3575045,158354,969

%N Triangular array T(n,k) giving number of alternating link diagrams with n >= 0 crossings, k = 0..[n/2] connected components and two external legs.

%C Rows have lengths 1,1,2,2,3,3,4,4,...

%H J. L. Jacobsen and P. Zinn-Justin, <a href="http://arXiv.org/abs/math-ph/0104009">A Transfer Matrix approach to the Enumeration of Colored Links</a>, J. Knot Theory, 10 (2001), 1233-1267.

%e 1; 2; 8,1; 42,12; 260,114,4; 1796,1030,90; ...

%Y Columns give A054993, A062386, A067767, A067768.

%K nonn,tabf

%O 0,2

%A _N. J. A. Sloane_, Feb 09 2002

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 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)