cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A316261 The number of ways to induce a single pinch on a compact 2-manifold with n handles. (Note: The manifold is embedded in Euclidean 2-space, and each pinch partitions it into at most two submanifolds.)

This page as a plain text file.
%I A316261 #55 Aug 10 2018 09:14:56
%S A316261 1,3,9,15,26,37,55,73,100,127,165,203,254,305,371,437,520,603,705,807,
%T A316261 930,1053,1199,1345,1516,1687,1885,2083,2310,2537,2795,3053,3344,3635,
%U A316261 3961,4287,4650,5013,5415,5817,6260
%N A316261 The number of ways to induce a single pinch on a compact 2-manifold with n handles. (Note: The manifold is embedded in Euclidean 2-space, and each pinch partitions it into at most two submanifolds.)
%C A316261 The formula for this sequence can be derived by separating the conformed manifolds into three sets. The first set consists of those conformations where the handles of the manifold are pinched at the boundary, the second set have two or more handles pinched at the interior of the manifold, and the third set are pinched at the boundary and may or may not have handles drawn into this pinch. The order of the first set is n, the order of the second is n - 1, and the order of the third set is given by the following series: (Sum_{k mod 2 = 0..n} (k/2)*(n - k + 1) + (2*(n - k) + (-1)^(n - k) + 3)/4) + (Sum_{j mod 2 = 1..n} ((j + 1)/2)*(n - j + 1)). These can then be combined into a single expression, Sum_{i = 0..n} ((2*i + (-1)^(i + 1) + 1)/4)*(n - i + 1) + ((2*(n - i) + (-1)^(n - i) + 3)/4)*(((-1)^i + 1)/2). The i in this series can be thought of as the number of handles drawn into the central pinch. If one factors out the expressions in the series and simplifies each term individually, the resulting functions can then be combined into a single formula. However, when we add 2n - 1 to this we find that for n = 0 the formula also equals zero. This cannot be, because there is one way to pinch a compact 2-manifold with 0 handles. Therefore, ((-1)^(2^n - 1) + 1)/2 is added as a corrective term for this one case.
%D A316261 Jonathan L. Gross, Jay Yellen, and Ping Zhang, The Handbook of Graph Theory (Second Edition), CRC Press, 2013, pp. 730-806.
%D A316261 Ana Claudia Nabarro, Juan J. Nuño-Ballesteros, Raúl Oset Sinha, Maria Aparecida Soares Ruas, Contemporary Mathematics: Real and Complex Singularities, American Mathematical Soc., 2014, pp. 50-51.
%H A316261 Colin Barker, <a href="/A316261/b316261.txt">Table of n, a(n) for n = 0..1000</a>
%H A316261 Jonathan L. Gross, Jay Yellen, and Ping Zhang, <a href="https://books.google.com/books?id=cntcAgAAQBAJ&amp;printsec=frontcover&amp;source=gbs_ge_summary_r&amp;cad=0#v=onepage&amp;q&amp;f=false">The Handbook of Graph Theory (Second Edition)</a>
%H A316261 Allen Hatcher, <a href="http://www.math.cornell.edu/~hatcher/AT/ATch0.pdf">Algebraic Topology (Ch. 0)</a>
%H A316261 Ana Claudia Nabarro, Juan J. Nuño-Ballesteros, Raúl Oset Sinha, Maria Aparecida Soares Ruas, <a href="https://books.google.com/books?id=9BlSDQAAQBAJ&amp;printsec=frontcover&amp;source=gbs_ge_summary_r&amp;cad=0#v=onepage&amp;q&amp;f=false">Contemporary Mathematics: Real and Complex Singularities</a>
%H A316261 Pseudomanifold. <a href="https://www.encyclopediaofmath.org/index.php/Pseudo-manifold">The Encyclopedia of Mathematics</a>
%H A316261 Joseph Wheat, <a href="https://drive.google.com/folderview?id=1p4hk2VxV6RaIFsbMLi2gkCBgFOQeX6ij">Visual Example of n = 3</a>
%H A316261 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-4,1,2,-1).
%F A316261 a(n) = (2*n^3 + 12*n^2 + 73*n + 3*(n + 2)*(-1)^n - 6)/24 + ((-1)^(2^n - 1) + 1)/2.
%F A316261 From _Colin Barker_, Jul 05 2018: (Start)
%F A316261 G.f.: (1 + x + 2*x^2 - 2*x^3 - 2*x^4 + x^5 + x^6) / ((1 - x)^4*(1 + x)^2).
%F A316261 a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + a(n-4) + 2*a(n-5) - a(n-6) for n>6.
%F A316261 (End)
%e A316261 For a visual example see links.
%t A316261 a[n_] := (2 n^3 + 12 n^2 + 73 n + 3 (n + 2)*(-1)^n - 6)/24 + ((-1)^(2^n - 1) + 1)/2; Array[a, 50, 0] (* or *)
%t A316261 CoefficientList[ Series[(x^6 + x^5 - 2x^4 - 2x^3 + 2x^2 + x + 1)/((x - 1)^4 (x + 1)^2), {x, 0, 50}], x] (* _Robert G. Wilson v_, Jul 23 2018 *)
%o A316261 (PARI) Vec((1 + x + 2*x^2 - 2*x^3 - 2*x^4 + x^5 + x^6) / ((1 - x)^4*(1 + x)^2) + O(x^50)) \\ _Colin Barker_, Jul 05 2018
%Y A316261 Cf. A087811.
%K A316261 nonn,easy
%O A316261 0,2
%A A316261 _Joseph Wheat_, Jun 27 2018