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!)
A308305 a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393). 2

%I #49 Sep 08 2022 08:46:21

%S 1,2,6,18,46,101,197,351,583,916,1376,1992,2796,3823,5111,6701,8637,

%T 10966,13738,17006,20826,25257,30361,36203,42851,50376,58852,68356,

%U 78968,90771,103851,118297,134201,151658,170766,191626,214342,239021,265773,294711

%N a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393).

%C Pairwise perpendicular bisectors divide the Euclidean plane into a maximum of a(n) regions. This maximum value a(n) occurs when no three points are collinear and no four points are concyclic in the plane, and with no perpendicular bisectors parallel or coinciding [Zaslavsky, Eq. (1.1)]. This count of regions in the plane is relevant for social science applications to voting preferences based on proximity to candidates on issues.

%D T. Zaslavsky, Perpendicular dissections of space. Discrete Comput. Geom. 27 (2002), no. 3, 303-351.

%H Colin Barker, <a href="/A308305/b308305.txt">Table of n, a(n) for n = 1..1000</a>

%H Alvaro Carbonero, Beth Anne Castellano, Gary Gordon, Charles Kulick, Karie Schmitz, and Brittany Shelton, <a href="https://arxiv.org/abs/2106.14140">Permutations of point sets in R_d</a>, arXiv:2106.14140 [math.CO], 2021.

%H I. J. Good and T. N. Tideman, <a href="http://dx.doi.org/10.1016/0097-3165(77)90077-2">Stirling numbers and a geometric structure from voting theory</a>, J. Combinatorial Theory Ser. A 23 (1977), 34-45.

%H T. Zaslavsky, <a href="https://arxiv.org/abs/1001.4435">Perpendicular dissections of space</a>, arXiv:1001.4435 [math.CO], 2010. See equation (1.1) with d=2.

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).

%F a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind.

%F a(n) = (1/24)*(24 - 14*n + 21*n^2 - 10*n^3 + 3*n^4).

%F From _Colin Barker_, Jun 30 2019: (Start)

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

%F a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>5.

%F (End)

%t Table[(1/24)(24 - 14 i + 21 i^2 - 10 i^3 + 3 i^4), {i, 40}]

%o (Magma) [(1/24)*(24 - 14*n + 21*n^2 - 10*n^3 + 3*n^4): n in [1..40]]; // _Vincenzo Librandi_, Jun 30 2019

%o (PARI) Vec(x*(1 - 3*x + 6*x^2 - 2*x^3 + x^4) / (1 - x)^5 + O(x^40)) \\ _Colin Barker_, Jun 30 2019

%Y The unsigned Stirling numbers of the first kind s(n,k) are given in A132393.

%Y The division of space formulation can be generalized to higher dimensions with use of A008275 by Good and Tideman's work.

%Y The maximum number of regions generated by pairwise perpendicular bisectors on a sphere is given by A087645.

%K nonn,easy

%O 1,2

%A _Alvaro Carbonero_, _Elizabeth Castellano_, _Charles Kulick_, _Karie Schmitz_, Jun 05 2019

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 March 28 07:33 EDT 2024. Contains 371235 sequences. (Running on oeis4.)