A018240 -id:A018240 - cp's OEIS frontend

A090596 Duplicate of A018240.

1, 1, 2, 3, 7, 12, 24, 45, 91, 176, 352, 693, 1387, 2752, 5504, 10965, 21931, 43776, 87552, 174933, 349867, 699392, 1398784, 2796885, 5593771, 11186176, 22372352, 44741973, 89483947, 178962432, 357924864, 715838805, 1431677611, 2863333376, 5726666752

Offset: 3

dead

A005418 Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.

Original entry on oeis.org

1, 2, 3, 6, 10, 20, 36, 72, 136, 272, 528, 1056, 2080, 4160, 8256, 16512, 32896, 65792, 131328, 262656, 524800, 1049600, 2098176, 4196352, 8390656, 16781312, 33558528, 67117056, 134225920, 268451840, 536887296, 1073774592, 2147516416, 4295032832

Offset: 1

N. J. A. Sloane, R. K. Guy

Equivalently, walks on triangle, visiting n+2 vertices, so length n+1, n "corners"; the symmetry group is S3, reversing a walk does not count as different. Walks are not self-avoiding. - Colin Mallows
Slavik V. Jablan observes that this is also the number of rational knots and links with n+2 crossings (cf. A018240). See reference. [Corrected by Andrey Zabolotskiy, Jun 18 2020]
Number of bit strings of length (n-1), not counting strings which are the end-for-end reversal or the 0-for-1 reversal of each other as different. - Carl Witty (cwitty(AT)newtonlabs.com), Oct 27 2001
The formula given in page 1095 of the Balasubramanian reference can be used to derive this sequence. - Parthasarathy Nambi, May 14 2007
Also number of compositions of n up to direction, where a composition is considered equivalent to its reversal, see example. - Franklin T. Adams-Watters, Oct 24 2009
Number of normally non-isomorphic realizations of the associahedron of type I starting with dimension 2 in Ceballos et al. - Tom Copeland, Oct 19 2011
Number of fibonacenes with n+2 hexagons. See the Balaban and the Dobrynin references. - Emeric Deutsch, Apr 21 2013
From the point of view of binary grids, it is a (1,n)-rectangular grid. A225826 to A225834 are the numbers of binary pattern classes in the (m,n)-rectangular grid, 1 < m < 11. - Yosu Yurramendi, May 19 2013
Number of n-vertex difference graphs (bipartite 2K_2-free graphs) [Peled & Sun, Thm. 9]. - Falk Hüffner, Jan 10 2016
The offset should be 0, since the first row of A034851 is row 0. The name would then be: "Number of n bead...". - Daniel Forgues, Jul 26 2018
a(n) is the number of non-isomorphic generalized rigid ladders with n cells. A generalized rigid ladder with n cells is a graph with vertex set is the union of {u_0, u_1, ..., u_n} and {v_0, v_1, ..., v_n}, and for every 0 <= i <= n-1, the edges are of the form {u_i,u_i+1}, {v_i, v_i+1}, {u_i,v_i} and either {u_i,v_i+1} or {u_i+1,v_i}. - Christian Barrientos, Jul 29 2018
Also number of non-isomorphic stairs with n+1 cells. A stair is a snake polyomino allowing only two directions for adjacent cells: east and north. - Christian Barrientos and Sarah Minion, Jul 29 2018
From Robert A. Russell, Oct 28 2018: (Start)
There are two different unoriented row colorings using two colors that give us very similar results here, a difference of one in the offset. In an unoriented row, chiral pairs are counted as one.
a(n) is the number of color patterns (set partitions) of an unoriented row of length n using two or fewer colors (subsets). Two color patterns are equivalent if the colors are permutable.
a(n+1) is the number of ways to color an unoriented row of length n using two noninterchangeable colors (one need not use both colors).
See the examples below of these two different colorings. (End)
Also arises from the enumeration of types of based polyhedra with exactly two triangular faces [Rademacher]. - N. J. A. Sloane, Apr 24 2020
a(n) is the number of (unlabeled) 2-paths with n+4 vertices. (A 2-path with order n at least 4 can be constructed from a 3-clique by iteratively adding a new 2-leaf (vertex of degree 2) adjacent to an existing 2-clique containing an existing 2-leaf.) - Allan Bickle, Apr 05 2022
a(n) is the number of caterpillars with a perfect matching and order 2n+2. - Christian Barrientos, Sep 12 2023
a(n) is also the number of distinct planar embeddings of the (n+2)-centipede graph (up to at least n=8 and likely for all larger n). - Eric W. Weisstein, May 21 2024
a(n) is also the number of distinct planar embeddings of the 2 X (n+2) grid graph i.e., the (n+2)-ladder graph. - Eric W. Weisstein, May 21 2024
Dimension of the homogeneous component of degree n of the free Jordan algebra on two generators (or, in this case, the free special Jordan algebra on two generators). It follows from (Shirshov 1956, Cohn 1959). - Vladimir Dotsenko, Mar 29 2025

			a(5) = 10 because there are 16 compositions of 5 (shown as <vectors>) but only 10 equivalence classes (shown as {sets}): {<5>}, {<4,1>,<1,4>}, {<3,2>,<2,3>}, {<3,1,1>,<1,1,3>}, {<1,3,1>},{<2,2,1>,<1,2,2>}, {<2,1,2>}, {<2,1,1,1>,<1,1,1,2>}, {<1,2,1,1>,<1,1,2,1>}, {<1,1,1,1,1>}. - _Geoffrey Critzer_, Nov 02 2012
G.f. = x + 2*x^2 + 3*x^3 + 6*x^4 + 10*x^5 + 20*x^6 + 36*x^7 + 72*x^8 + ... - _Michael Somos_, Jun 24 2018
From _Robert A. Russell_, Oct 28 2018: (Start)
For a(5)=10, the 4 achiral patterns (set partitions) are AAAAA, AABAA, ABABA, and ABBBA. The 6 chiral pairs are AAAAB-ABBBB, AAABA-ABAAA, AAABB-AABBB, AABAB-ABABB, AABBA-ABBAA, and ABAAB-ABBAB. The colors are permutable.
For n=4 and a(n+1)=10, the 4 achiral colorings are AAAA, ABBA, BAAB, and BBBB. The 6 achiral pairs are AAAB-BAAA, AABA-ABAA, AABB-BBAA, ABAB-BABA, ABBB-BBBA, and BABB-BBAB. The colors are not permutable. (End)

K. Balasubramanian, "Combinatorial Enumeration of Chemical Isomers", Indian J. Chem., (1978) vol. 16B, pp. 1094-1096. See page 1095.
Wayne M. Dymacek, Steinhaus graphs. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979), pp. 399--412, Congress. Numer., XXIII-XXIV, Utilitas Math., Winnipeg, Man., 1979. MR0561065 (81f:05120)
Jablan S. and Sazdanovic R., LinKnot: Knot Theory by Computer, World Scientific Press, 2007.
Joseph S. Madachy: Madachy's Mathematical Recreations. New York: Dover Publications, Inc., 1979, p. 46 (first publ. by Charles Scribner's Sons, New York, 1966, under the title: Mathematics on Vacation)
M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2.]
C. A. Pickover, Keys to Infinity, Wiley 1995, p. 75.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
M. Archibald, A. Blecher, A. Knopfmacher, and M. E. Mays, Inversions and Parity in Compositions of Integers, J. Int. Seq., Vol. 23 (2020), Article 20.4.1.
Joerg Arndt, Matters Computational (The Fxtbook), pp. 151 and 733.
Andrei Asinowski and Alon Regev, Triangulations with Few Ears: Symmetry Classes and Disjointness, Integers 16 (2016), #A5.
A. T. Balaban, Chemical graphs. Part 50. Symmetry and enumeration of fibonacenes (unbranched catacondensed benzenoids isoarithmic with helicenes and zigzag catafusenes), MATCH: Commun. Math. Comput. Chem., 24 (1989) 29-38.
Allan Bickle, How to Count k-Paths, J. Integer Sequences, 25 (2022) Article 22.5.6.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
A. P. Burger, M. Van Der Merwe, and J. H. Van Vuuren, An asymptotic analysis of the evolutionary spatial prisoner's dilemma on a path, Discrete Appl. Math. 160, No. 15, 2075-2088 (2012), Table 3.1.
C. Ceballos, F. Santos, and G. Ziegler, Many Non-equivalent Realizations of the Associahedron, arXiv:1109.5544 [math.MG], 2011-2013; pp. 15 and 26.
P. M. Cohn, Two embedding theorems for Jordan algebras, Proceedings of the London Mathematical Society, Volume s3-9, Issue 4, October 1959, pp. 503-524.
Jacob Crabtree, Another Enumeration of Caterpillar Trees, arXiv:1810.11744 [math.CO], 2018.
S. J. Cyvin, B. N. Cyvin, J. Brunvoll, E. Brendsdal, Zhang Fuji, Guo Xiaofeng, and R. Tosic, Theory of polypentagons, J. Chem. Inf. Comput. Sci., 33 (1993), 466-474.
Miroslav Marinov Dimitrov, Designing Boolean Functions and Digital Sequences for Cryptology and Communications, Ph. D. Dissertation, Bulgarian Acad. Sci. (Sofia, Bulgaria 2023).
A. A. Dobrynin, On the Wiener index of fibonacenes, MATCH: Commun. Math. Comput. Chem, 64 (2010), 707-726.
Vladimir Dotsenko and Irvin Roy Hentzel, On the conjecture of Kashuba and Mathieu about free Jordan algebras, arXiv:2507.00437 [math.RA], 2025. See p. 14.
J. Eckhoff, Extremal interval graphs, J. Graph Theory 17 1 (1993), 117-127.
Sahir Gill, Bounds for Region Containing All Zeros of a Complex Polynomial, International Journal of Mathematical Analysis (2018), Vol. 12, No. 7, 325-333.
T. A. Gittings, Minimum braids: a complete invariant of knots and links, arXiv:math/0401051 [math.GT], 2004. - _N. J. A. Sloane_, Jan 18 2013
R. K. Guy, Letter to N. J. A. Sloane, Nov 1978.
Frank Harary and Allen J. Schwenk, The number of caterpillars, Discrete Mathematics, Volume 6, Issue 4, 1973, 359-365.
N. Hoffman, Binary grids and a related counting problem, Two-Year College Math. J. 9 (1978), 267-272.
S. V. Jablan, Geometry of Links, XII Yugoslav Geometric Seminar (Novi Sad, 1998), Novi Sad J. Math. 29 (1999), no. 3, 121-139.
S. M. Losanitsch, Die Isomerie-Arten bei den Homologen der Paraffin-Reihe, Chem. Ber. 30 (1897), 1917-1926. (Annotated scanned copy)
Isaac B. Michael and M. R. Sepanski, Net regular signed trees, Australasian Journal of Combinatorics, Volume 66(2) (2016), 192-204.
U. N. Peled and F. Sun, Enumeration of difference graphs, Discrete Appl. Math., 60 (1995), 311-318.
Paulo Renato da Costa Pereira, Lilian Markenzon and Oswaldo Vernet, A clique-difference encoding scheme for labelled k-path graphs, Discrete Appl. Math. 156 (2008), 3216-3222.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Hans Rademacher, On the number of certain types of polyhedra, Illinois Journal of Mathematics 9.3 (1965): 361-380. Reprinted in Coll. Papers, Vol II, MIT Press, 1974, pp. 544-564. See Theorem 8, Eq. 14.3.
A. Regev, Remarks on two-eared triangulations, arXiv preprint arXiv:1309.0743 [math.CO], 2013-2014.
Suthee Ruangwises, The Landscape of Computing Symmetric n-Variable Functions with 2n Cards, arXiv:2306.13551 [cs.CR], 2023.
A. I. Shirshov, On special J-rings, Mat. Sb. (N.S.), 38(80), 1956, pp. 149-166.
N. J. A. Sloane, Classic Sequences
R. A. Sulanke, Moments of generalized Motzkin paths, J. Integer Sequences, Vol. 3 (2000), Article #00.1.1.
Eric Weisstein's World of Mathematics, Barker Code.
Eric Weisstein's World of Mathematics, Bishops Problem.
Eric Weisstein's World of Mathematics, Caterpillar Graph.
Eric Weisstein's World of Mathematics, Centipede Graph.
Eric Weisstein's World of Mathematics, Grid Graph.
Eric Weisstein's World of Mathematics, Ladder Graph.
Eric Weisstein's World of Mathematics, Losanitsch's Triangle.
Eric Weisstein's World of Mathematics, Planar Embedding.
A. Yajima, How to calculate the number of stereoisomers of inositol-homologs, Bull. Chem. Soc. Jpn. 87 (2014), 1260-1264; see Tables 1 and 2 (and text). - _N. J. A. Sloane_, Mar 26 2015
Index entries for linear recurrences with constant coefficients, signature (2,2,-4).

Column 2 of A320750 (set partitions).
Cf. A131577 (oriented), A122746(n-3) (chiral), A016116 (achiral), for set partitions with up to two subsets.
Column 2 of A277504, offset by one (colors not permutable).
Cf. A000079 (oriented), A122746(n-2) (chiral), and A060546 (achiral), for a(n+1).
Cf. A001998, A001444, A051436, A051437, A007582, A001445, A032085.

a005418 n = sum $ a034851_row (n - 1) -- Reinhard Zumkeller, Jan 14 2012

A005418 := n->2^(n-2)+2^(floor(n/2)-1): seq(A005418(n), n=1..34);

LinearRecurrence[{2,2,-4}, {1,2,3}, 40] (* or *) Table[2^(n-2)+2^(Floor[n/2]-1), {n,40}] (* Harvey P. Dale, Jan 18 2012 *)

A005418(n)= 2^(n-2) + 2^(n\2-1); \\ Joerg Arndt, Sep 16 2013

def A005418(n): return 1 if n == 1 else 2**((m:= n//2)-1)*(2**(n-m-1)+1) # Chai Wah Wu, Feb 03 2022

a(n) = 2^(n-2) + 2^(floor(n/2) - 1).
G.f.: -x*(-1 + 3*x^2) / ( (2*x - 1)*(2*x^2 - 1) ). - Simon Plouffe in his 1992 dissertation
G.f.: x*(1+2*x)*(1-3*x^2)/((1-4*x^2)*(1-2*x^2)), not reduced. - Wolfdieter Lang, May 08 2001
a(n) = 6*a(n - 2) - 8*a(n - 4). a(2*n) = A063376(n - 1) = 2*a(2*n - 1); a(2*n + 1) = A007582(n). - Henry Bottomley, Jul 14 2001
a(n+2) = 2*a(n+1) - A077957(n) with a(1) = 1, a(2) = 2. - Yosu Yurramendi, Oct 24 2008
a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3). - Jaume Oliver Lafont, Dec 05 2008
Union of A007582 and A161168. Union of A007582 and A063376. - Jaroslav Krizek, Aug 14 2009
G.f.: G(0); G(k) = 1 + 2*x/(1 - x*(1+2^(k+1))/(x*(1+2^(k+1)) + (1+2^k)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Dec 12 2011
a(2*n) = 2*a(2*n-1) and a(2*n+1) = a(2*n) + 4^(n-1) with a(1) = 1. - Johannes W. Meijer, Aug 26 2013
From Robert A. Russell, Oct 28 2018: (Start)
a(n) = (A131577(n) + A016116(n)) / 2 = A131577(n) - A122746(n-3) = A122746(n-3) + A016116(n), for set partitions with up to two subsets.
a(n+1) = (A000079(n) + A060546(n)) / 2 = A000079(n) - A122746(n-2) = A122746(n-2) + A060546(n), for two colors that do not permute.
a(n) = Sum_{j=0..k} (S2(n,j) + Ach(n,j)) / 2, where k=2 is the maximum number of colors, S2(n,k) is the Stirling subset number A008277, and Ach(n,k) = [n>=0 & n<2 & n==k] + [n>1]*(k*Ach(n-2,k) + Ach(n-2,k-1) + Ach(n-2,k-2)).
a(n+1) = (k^n + k^ceiling(n/2)) / 2, where k=2 is number of colors we can use. (End)
E.g.f.: (cosh(2*x) + 2*cosh(sqrt(2)*x) + sinh(2*x) + sqrt(2)*sinh(sqrt(2)*x) - 3)/4. - Stefano Spezia, Jun 01 2022

A078477 Number of rational knots with n crossings and unknotting number = 1 (chiral pairs counted only once).

Original entry on oeis.org

1, 1, 1, 3, 3, 6, 7, 15, 15, 30, 31, 63, 63, 126, 127, 255, 255, 510, 511, 1023, 1023, 2046, 2047, 4095, 4095, 8190, 8191, 16383, 16383, 32766, 32767, 65535, 65535, 131070, 131071, 262143, 262143, 524286, 524287, 1048575, 1048575, 2097150, 2097151

Offset: 3

Ralf Stephan, Jan 03 2003

From Alexander Adamchuk, Nov 16 2009: (Start)
For n>1 a(2n+1) = 2^(n-1) - 1 = A000225(n-1).
For n>1 a(4n) = a(4n+1) - 1 = 2^(2n-1) - 2.
For n>0 a(4n+2) = a(4n+3) = 2^(2n) - 1. (End)

Andrey Zabolotskiy, Table of n, a(n) for n = 3..1000
A. Stoimenow, Generating Functions, Fibonacci Numbers and Rational Knots, Journal of Algebra, 310 (2007), 491-525; arXiv:math/0210174 [math.GT], 2002.
Index entries for linear recurrences with constant coefficients, signature (0,2,0,1,0,-2).

Cf. A000225, A018240, A089891, A089892, A089797, A051449, A214927, A051450, A078478.

CoefficientList[Series[(2 x^7 + 2 x^6 - x^5 + x^3 - x^2 + x + 1) / ((x-1) (x+1) (x^2+1) (2 x^2-1)), {x, 0, 50}], x] (* Vincenzo Librandi, May 17 2013 *)

Vec(x^3*(1+x-x^2+x^3-x^5+2*x^6+2*x^7)/((1-x)*(1+x)*(1+x^2)*(1-2*x^2)) + O(x^60)) \\ Colin Barker, Dec 26 2015

G.f.: x^3*(1+x-x^2+x^3-x^5+2*x^6+2*x^7) / ((1-x)*(1+x)*(1+x^2)*(1-2*x^2)).

a(n) = 2*a(n-2)+a(n-4)-2*a(n-6) for n>10. - Colin Barker, Dec 26 2015

A090597 a(n) = - a(n-1) + 5(a(n-2) + a(n-3)) - 2(a(n-4) + a(n-5)) - 8(a(n-6) + a(n-7)).

Original entry on oeis.org

0, 1, 1, 3, 3, 8, 12, 27, 45, 96, 176, 363, 693, 1408, 2752, 5547, 10965, 22016, 43776, 87723, 174933, 350208, 699392, 1399467, 2796885, 5595136, 11186176, 22375083, 44741973, 89489408

Offset: 3

Thomas A. Gittings, Dec 11 2003

Arises from a conjecture about sequence of rational links with n crossings.
Conjecture derived from: s(n) = k(n) + l(n): definition of sum of rational knots (k) and links (l) s(n) = 6s(n-2) -8s(n-4): see A005418 (Jablan's observation) d(n) = d(n-2) + 2d(n-4): see A001045 (modified Jacobsthal sequence) l(n) = k(n-1) + d(n): conjecture.
a(n) is the number of rational (2-component) links. - Slavik Jablan, Dec 26 2003
Also yields the number of meanders, reduced by symmetry, on an n X 3 rectangle (see A200893). - Jon Wild, Nov 25 2011

Reinhard Zumkeller, Table of n, a(n) for n = 3..1000
C. Ernst and D. W. Sumners, The Growth of the Number of Prime Knots, Math. Proc. Cambridge Philos. Soc. 102, 303-315, 1987 (see Theorem 5, formulas for TL_n).
Index entries for linear recurrences with constant coefficients, signature (1,3,-1,0,-2,-4).

This is the difference between A005418 and A018240.
Cf. A018240 = sequence of rational knots, A005418 = number of rational knots and links, A001045 = Jacobsthal sequence, A329908, A336398.
Cf. A200893, and see the third column of the triangle read by rows there.

a090597 n = a090597_list !! (n-3)
a090597_list = [0,1,1,3,3,8,12] ++ zipWith (-)
   (drop 4 $ zipWith (-) (map (* 5) zs) (drop 2 a090597_list))
   (zipWith (+) (drop 2 $ map (* 2) zs) (map (* 8) zs))
   where zs = zipWith (+) a090597_list $ tail a090597_list
-- Reinhard Zumkeller, Nov 24 2011

f[x_] := (x-x^3-2x^4-3x^5) / (1-x-3x^2+x^3+2x^5+4x^6); CoefficientList[ Series[ f[x], {x, 0, 29}], x] (* Jean-François Alcover, Dec 06 2011 *)
J[n_] := (2^n - (-1)^n)/3; Table[(J[n - 3] + J[(n - If[OddQ[n], 3, 0])/2])/2 , {n, 3, 31}] (* David Scambler, Dec 13 2011 *)
LinearRecurrence[{1,3,-1,0,-2,-4},{0,1,1,3,3,8},30] (* Harvey P. Dale, Nov 12 2013 *)

a(n) = +a(n-1) +3*a(n-2) -a(n-3) -2*a(n-5) -4*a(n-6). - R. J. Mathar, Nov 23 2011
G.f.: -x^4*(-1+x^2+3*x^4+2*x^3) / ( (2*x-1)*(1+x)*(2*x^2-1)*(1+x^2) ). - R. J. Mathar, Nov 23 2011
a(n) = (J(n-3) + J((n-3)/2))/2 if n is odd; (J(n-3) + J(n/2))/2 if n is even, where J is the Jacobsthal number A001045. - David Scambler, Dec 12 2011

A329908 Number of oriented rational links with crossing number n.

Original entry on oeis.org

2, 2, 5, 6, 15, 24, 51, 90, 187, 352, 715, 1386, 2795, 5504, 11051, 21930, 43947, 87552, 175275, 349866, 700075, 1398784, 2798251, 5593770, 11188907, 22372352, 44747435, 89483946, 178973355, 357924864, 715860651, 1431677610, 2863377067, 5726666752, 11453377195

Offset: 2

Michel Marcus, Jul 07 2020

Yuanan Diao, Michael Finney, and Dawn Ray, The number of oriented rational links with a given deficiency number, arXiv:2007.02819 [math.GT], 2020. See Theorem 3 p.9 and Table 1 p. 14.
C. Ernst and D. W. Sumners, The Growth of the Number of Prime Knots, Math. Proc. Cambridge Philos. Soc. 102, 303-315, 1987 (see Theorem 1, formulas for TL_n^*).
Index entries for linear recurrences with constant coefficients, signature (1,3,-1,0,-2,-4).

Cf. A018240, A090597, A336398.

a(n) = if (n%2, if ((n%4)==1, (2^(n-1)+2^((n-1)/2)-2)/3, (2^(n-1)+2^((n-1)/2))/3), (2^(n-1)+1)/3 + 2^(n/2-1));

a(n) = (2^(n-1)+1)/3 + 2^(n/2-1) if n is even; (2^(n-1)+2^((n-1)/2)-2)/3 if n is odd and n == 1 mod 4; (2^(n-1)+2^((n-1)/2))/3 if n is odd and n == 3 mod 4.
G.f.: x^2*(2 - 3*x^2 - 3*x^3 - 4*x^4)/(1 - x - 3*x^2 + x^3 + 2*x^5 + 4*x^6). - Jinyuan Wang, Jul 08 2020
From Wesley Ivan Hurt, Jul 17 2025: (Start)
a(n) = (2^(n+1)+2^(n/2)*(3+sqrt(2)+(-1)^n*(3-sqrt(2)))+4*((-1)^n+sin(3*n*Pi/2)))/12.
a(n) = a(n-1) + 3*a(n-2) - a(n-3) - 2*a(n-5) - 4*a(n-6). (End)

A336398 Number of rational knots (or two-bridge knots) with n crossings (chiral pairs counted as distinct).

Original entry on oeis.org

0, 2, 1, 4, 5, 14, 21, 48, 85, 182, 341, 704, 1365, 2774, 5461, 11008, 21845, 43862, 87381, 175104, 349525, 699734, 1398101, 2797568, 5592405, 11187542, 22369621, 44744704, 89478485, 178967894, 357913941, 715849728

Offset: 2

Andrey Zabolotskiy, Jul 20 2020

C. Ernst and D. W. Sumners, The Growth of the Number of Prime Knots, Math. Proc. Cambridge Philos. Soc. 102, 303-315, 1987 (see Theorem 1, formulas for TK_n^*).
Taizo Kanenobu and Toshio Sumi, Polynomial Invariants of 2-Bridge Knots through 22 Crossings, Math. Comp. 60 (1993), 771-778, S17 (see Table 2).
Index entries for linear recurrences with constant coefficients, signature (1,3,-1,0,-2,-4).

Cf. A018240, A090597, A329908.

[(2**(n-2) + [-1, 2**(n//2), -1, 2**(n//2)+2][n%4])//3 for n in range(2, 30)]

(2^(n-2) - 1) / 3 if n is even,
(2^(n-2) + 2^((n-1)/2)) / 3 if n = 1 (mod 4),
(2^(n-2) + 2^((n-1)/2) + 2) / 3 if n = 3 (mod 4).
a(n) = a(n-1) + 3*a(n-2) - a(n-3) - 2*a(n-5) - 4*a(n-6).

A122495 Integers corresponding to rational knots in Conway's enumeration.

Original entry on oeis.org

1, 3, 22, 5, 32, 42, 312, 2112, 7, 52, 43, 322, 313, 2212, 21112, 62, 512, 44, 413, 4112, 332, 3212, 3113, 31112, 2312, 2222, 22112, 9, 72, 63, 54, 522, 513, 423, 4212, 4122, 41112, 342, 333, 3222, 3213, 31212, 31122, 311112, 2412, 2322, 23112, 22122, 21312

Offset: 1

Jonathan Vos Post, Sep 16 2006

nonn

"Conway's motivation for studying tangles was to extend the [knot and link] catalogues.... here we shall concentrate on finding the first few rational links.
"The problem is reduced to listing sequences of integers and noting which sequences lead to isotopic links.
"The technique is so powerful that Conway claims to have verified the Tait-Little tables 'in an afternoon'.
"He then went on to list the 100-crossings knots and 10-crossing links.... A rational link (or its mirror image) has a regular continued fraction expansion in which all the integers are positive....
"We can discard all sequences that end in a 1 and that makes the regular sequence unique.... we do not need to keep both a sequence and its reverse.
"Applying these simple rules to the partitions of the first four integers, we see that we keep only the sequences shown in bold: 1, 2, 11, 3, 21, 12, 111, 4, 31, 22, 13, 211, 121, 112, 1111." [typographically, the bold subsequence is 1, 2, 3, 4, 22] "These sequences correspond to the trivial knot, the Hopf link, the trefoil, the (2,4) torus link and the figure 8 knot.
"Continuing in this fashion, we find that for knots and links with up to seven crossings, the sequences for rational knots are: 3, 22, 5, 32, 42, 312, 2112, 7, 52, 43, 322, 313, 2212, 21112 and the sequences for rational 2-component links are 2, 4, 212, 6, 33, 222, 412, 232, 3112.... we see that a sequence represents an amphicheiral knot or link only if the sequence is palindromic (equal to its reverse) and of even length (n even).
"This shows that the only amphicheiral knots in the list are the figure-8 knot (sequence 22) and the knot 6_3 (sequence 2112); all of the links are cheiral...." [Cromwell]
The ordering among the terms with the same sum of digits (i.e., number of crossings) is the inverse lexicographical. Each term is actually an ordered set of positive integers, concatenated; as long as all integers are 1-digit, it's not a problem, but a(97) requires "digit" 11, so at that point the sequence becomes not fully well-defined. An irregular array of these numbers would be well-defined. - Andrey Zabolotskiy, May 22 2017

			a(1) = 1 because 1 corresponds to the trivial knot.
a(2) = 3 because 3 corresponds to the trefoil.
a(3) = 22 because 22 corresponds to the figure-8 knot.

Peter R. Cromwell, Knots and Links, Cambridge University Press, 2004, pp. 209-211.

Alain Caudron, Classification des noeuds et des enlancements (see p. 168).
J. H. Conway, An enumeration of knots and links and some of their algebraic properties, 1970. Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967) pp. 329-358 Pergamon, Oxford.
Index entries for sequences related to knots

Cf. A002863, A002864, A173637, A018240, A078666.

whereTangle[{n_}] := If[EvenQ[n], 1, 2];
whereTangle[{rest__, n_}] := Switch[whereTangle[{rest}], 1, 3, 2, Switch[whereTangle[{n}], 1, 2, 2, 1, 3, 3], 3, whereTangle[{n}]];
FromDigits /@ Prepend[Select[Flatten[Table[Reverse@SortBy[Flatten[Permutations /@ IntegerPartitions[n], 1], PadRight[#, n] &], {n, 10}], 1], OrderedQ[{Reverse[#], #}] && Last[#] != 1 && whereTangle[#] != 1 (*change to "==1" for rational 2-component links*) &], {1}]
(* Andrey Zabolotskiy, May 22 2017 *)

Sequence edited and more terms added by Andrey Zabolotskiy, May 22 2017

A245489 a(n) = (1^n + (-2)^n + 4^n)/3.

Original entry on oeis.org

1, 1, 7, 19, 91, 331, 1387, 5419, 21931, 87211, 349867, 1397419, 5593771, 22366891, 89483947, 357903019, 1431677611, 5726579371, 22906579627, 91625794219, 366504225451, 1466014804651, 5864063412907, 23456245263019, 93824997829291, 375299957762731

Offset: 0

Michael Somos, Jul 23 2014

			G.f. = 1 + x + 7*x^2 + 19*x^3 + 91*x^4 + 331*x^5 + 1387*x^6 + 5419*x^7 + ...

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,6,-8).

Cf. A001045, A018240, A129362.

List([0..30], n-> (1 +(-2)^n +4^n)/3); # G. C. Greubel, Sep 21 2019

[(1^n + (-2)^n + 4^n) / 3 : n in [0..30]]; // Vincenzo Librandi, Jul 25 2014

seq((1 +(-2)^n +4^n)/3, n=0..30); # G. C. Greubel, Sep 21 2019

CoefficientList[Series[(1-2x-2x^2)/((1-x)(1+2x)(1-4x)), {x, 0, 40}], x] (* Vincenzo Librandi, Jul 25 2014 *)
LinearRecurrence[{3,6,-8},{1,1,7},30] (* Harvey P. Dale, Dec 04 2018 *)

PARI
```
{a(n) = (1^n + (-2)^n + 4^n) / 3};
```

{a(n) = if( n<0, 4^n, 1) * polcoeff( (1 - 2*x - 2*x^2) / ((1 - x) * (1 + 2*x) * (1 - 4*x)) + x * O(x^abs(n)), abs(n))};

[(1 +(-2)^n +4^n)/3 for n in (0..30)] # G. C. Greubel, Sep 21 2019

G.f.: (1 - 2*x - 2*x^2) / ((1 - x) * (1 + 2*x) * (1 - 4*x)).
0 = 8*a(n) - 6*a(n+1) - 3*a(n+2) + a(n+3) for all n in Z.
a(2*n) = A018240(4*n + 3). a(2*n + 1) = A129362(4*n).
a(n) = A001045(3*n)/(3*A001045(n)) for n >= 1. - Peter Bala, Apr 06 2015
E.g.f.: (exp(x) + exp(4*x) + exp(-2*x))/3. - G. C. Greubel, Sep 21 2019

A089266 Rational knots of determinant 2n+1, counting chiral pairs twice.

Original entry on oeis.org

2, 3, 4, 4, 6, 7, 6, 9, 10, 8, 12, 11, 10, 15, 16, 12, 14, 19, 14, 21, 22, 14, 24, 22, 18, 27, 22, 20, 30, 31, 20, 26, 34, 24, 36, 37, 22, 32, 40, 28, 42, 34, 30, 45, 38, 32, 38, 49, 32, 51, 52, 28, 54, 55, 38, 57, 46, 38, 50, 56, 42, 51, 64, 44, 66, 56

Offset: 1

Ralf Stephan, Oct 30 2003

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
A. Stoimenow, Square numbers, spanning trees and invariants of rational knots (2000)

Cf. A078477, A078478, A018240, A051449, A051766.

a[n_] := (EulerPhi[2*n+1] + 2^PrimeNu[2*n+1])/2; Table[a[n], {n, 1, 66}] (* Jean-François Alcover, Oct 11 2013, after Pari *)

PARI
```
a(n)=(eulerphi(2*n+1)+2^omega(2*n+1))/2
```

a(n) = 1/2 * (A037225(n) + A034444(2*n+1)).

A173637 Conway notation for rational 2-component links.

Original entry on oeis.org

2, 4, 212, 6, 33, 222, 412, 3112, 232, 8, 53, 422, 323, 3122, 242, 21212, 211112, 612, 5112, 432, 414, 4113, 3312, 32112, 3132, 31113, 252, 22212, 221112

Offset: 1

Jonathan Vos Post, Nov 23 2010

nonn

The ordering of the list is based on increasing crossing numbers and inverse lexicographical order for the terms with the same crossing number.
This is to links what A122495 is to knots.
All these links are chiral.
Each term is actually an ordered set of positive integers, concatenated; as long as all integers are 1-digit, it's not a problem, but a(30) requires "digit" 10, so at that point the sequence becomes not fully well-defined. An irregular array of these numbers would be well-defined.
Number of the terms of this sequence with crossing number k plus number of the terms of A122495 with crossing number k equals A005418(k-2). - Andrey Zabolotskiy, May 23 2017

			a(1) = 2 because 2 is the Conway notation for the Hopf link.
a(2) = 4 because 4 is the Conway notation for the (2,4) torus link.

C. Cerf, Atlas of oriented knots and links, Topology Atlas 3 no.2 (1998).
Peter R. Cromwell, Knots and Links, Cambridge University Press, November 15, 2004, p.210.

J. H. Conway, An enumeration of knots and links and some of their algebraic properties, 1970. Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967) pp. 329-358 Pergamon, Oxford.
C. Giller, A family of links and the Conway calculus, Trans. American Math Soc., 270 (1982) 75-109.
Index entries for sequences related to knots

Cf. A002863, A002864, A018240, A090597, A122495.

Sequence edited and more terms added by Andrey Zabolotskiy, May 23 2017

cp's OEIS Frontend

A090596 Duplicate of A018240.

Views

Author

Keywords

A005418 Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Formula

A078477 Number of rational knots with n crossings and unknotting number = 1 (chiral pairs counted only once).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A090597 a(n) = - a(n-1) + 5(a(n-2) + a(n-3)) - 2(a(n-4) + a(n-5)) - 8(a(n-6) + a(n-7)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A329908 Number of oriented rational links with crossing number n.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A336398 Number of rational knots (or two-bridge knots) with n crossings (chiral pairs counted as distinct).

Views

Author

Keywords

Links

Crossrefs

Programs

Python

Formula

A122495 Integers corresponding to rational knots in Conway's enumeration.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Extensions

A245489 a(n) = (1^n + (-2)^n + 4^n)/3.

Views

Author

Keywords

Examples

Links

Crossrefs