A239074 -id:A239074 - cp's OEIS frontend

A239073 Given a circle of radius R into which small circles of radius R/2^n are packed in a "hexagonal pattern" (see Comments), a(n) is the maximum number of small circles.

1, 2, 10, 48, 208, 874, 3600, 14622, 58976, 236824, 949094, 3800126, 15207812, 60846154, 243414326, 973716670, 3894985588, 15580180122, 62321195992, 249285735518, 997144844044, 3988583179554, 15954340324098, 63817376508852, 255269536476262

Offset: 0

Kival Ngaokrajang, Mar 10 2014

nonn

The construction rule is: (1) Start with a unit circle (big circle). (2) Pack circles at radius 1/2^n (small circles) on the diameter line of the big circle. (3) Maintain hexagonal packing pattern of small circles on the rows above and below that of the previous step. The number of small circles in any row is limited so that the circumference of the last small circle does not cross the circumference of the big circle (but is allowed to contact it). (4) Repeat process to the top and bottom rows.
See illustration in links.
From Jon E. Schoenfield, Mar 23 2014: (Start)
There can never be exactly one small circle on the top row iMax (and, symmetrically, exactly one on the bottom row) that contacts the large circle, since the upper edge of that small circle would be at a radius of (iMax*sqrt(3)+1)/2^n from the center of the unit circle (which cannot equal 1 unless iMax=0, i.e., there are no rows above or below the center).
The number of small circles on the top row seems to be on the order of 2^(n/2). It seems nearly certain that, for n>0, there is never exactly one small circle on the top row. (End)
After Wolfdieter Lang's suggestions of an alternative definition, I found later that a(n) = A053417(2^n-1), n >= 1.

Kival Ngaokrajang, Illustration of initial terms
Kival Ngaokrajang, Small Basic program

Cf. A239074, A239206, A053417, A053416.

for n in [0..25] do
   x:=(2^n - 1)^2;
   c:=2^n; // for row i=0
   for i in [1..Isqrt(x div 3)] do
      t:=x-3*i*i;
      if IsOdd(i) then
         c:=c+2*(2*Floor(Sqrt(t)/2)+1);
      else
         c:=c+2*(2*Floor(Sqrt(t)/2+1/2));
      end if;
   end for;
   n, c;
end for; // Jon E. Schoenfield, Mar 17 2014

a(n) = 2^n + 2 * Sum_{i odd, <= iMax} (2*floor(sqrt(x - 3 * i^2) / 2) + 1) + 2 * Sum_{i even, 0 < i <= iMax} 2*floor(sqrt(x - 3 * i^2) / 2 + 1/2) where x = (2^n-1)^2 and iMax = floor(sqrt(x/3)). - Jon E. Schoenfield, Mar 17, Mar 23 2014

a(20) - a(24) and corrections to a(15), a(17), and a(18) from Jon E. Schoenfield, Mar 17 2014

A239206 a(n) is the total number of rows of circles of radius r packing into a circle of radius R, where r = R/2^n.

Original entry on oeis.org

1, 1, 3, 9, 17, 35, 73, 147, 295, 591, 1181, 2363, 4729, 9459, 18917, 37837, 75673, 151347, 302697, 605395, 1210791, 2421581, 4843163, 9686329, 19372659, 38745319, 77490641, 154981281, 309962565, 619925129, 1239850261, 2479700523, 4959401047, 9918802097

Offset: 0

Kival Ngaokrajang, Mar 12 2014

nonn

See illustration in link for construction rule.
From Wolfdieter Lang, Apr 01 2014: (Start)
Call in the above mentioned illustration (link) the horizontal layers with the y-axis (center as origin) intersecting a circle B-layers and the other ones A-layers. Consider first only the upper half, with the A-layer y=0 treated separately. The largest k value for B-layers  with yB(k) = sqrt(3)*(2*k + 1), k >= 0, is kBmax(n) = floor((2^n-1-sqrt(3))/(2*sqrt(3))), n>=2. Similarly, the largest k value for A-layers with yA(k) = sqrt(3)*2*k, k >= 0, is kAmax(n) = floor(sqrt((2^n-1)^2-1)/(2*sqrt(3))), n >= 1. For n=0 one has the large disk. If the top level is of B-type then 2*kBmax(n) + 1 >  2*kAmax(n). In this case the total number of layers (A or B) is 4*kBmax(n) + 3, n >= 2. In the other case (top level is of the A-type) it is 1 + 4*kAmax(n), n >= 1. With a(0) = 1 Kival Ngaokrajang's formula given below, which is a(n) = 2*floor((2^n-1)/sqrt(3)) + 1, seems to fit these numbers. (End)

Kival Ngaokrajang, Illustration of initial terms

Cf. A239073, A239074.

rcr[n_]:=Module[{r=1/2^n,c=Cos[Pi/6]},2*Floor[(1-r)/(2*r*c)]+1]; Array[ rcr,40,0] (* Harvey P. Dale, Dec 23 2014 *)

a(n) = 1 + 2*sqrtint((2^n-1)^2\3); \\ Andrew Howroyd, May 27 2018
(Small Basic)
For n = 0 To 50
  r = 1/Math.Power(2,n)
  a = 2*math.Floor((1-r)/(2*r*math.Cos(Math.Pi/6))) + 1
  TextWindow.Write(a+", ")
EndFor

a(n) = 2*floor((1-r)/(2*r*cos(Pi/6))) + 1, where r = 1/2^n.

a(n) = 2*floor(sqrt((2^n-1)^2/3)) + 1. - Andrew Howroyd, May 27 2018

A240501 Given circular disks of radius r in a hexagonal lattice covered by a circular disk of radius R = r*2n, if the center of the circle is chosen at the middle between two lattice points, a(n) is the number of points at which an r-circle is tangent to the R-circle.

Original entry on oeis.org

2, 2, 2, 6, 2, 2, 6, 2, 2, 6, 6, 2, 2, 2, 2, 6, 2, 6, 6, 6, 2, 6, 2, 2, 10, 2, 2, 2, 6, 2, 6, 6, 6, 6, 2, 2, 6, 2, 6, 6, 2, 2, 2, 2, 2, 18, 6, 6, 6, 2, 2, 6, 6, 2, 6, 6, 2, 2, 6, 6, 2, 2, 2, 6, 6, 2, 18, 2, 2, 6, 2, 6, 2, 10, 2, 6, 2, 6, 6, 2, 6, 6, 2, 2, 10, 6, 2, 6, 2, 2, 6, 6, 6, 2, 6, 2, 6, 6, 2, 6, 6, 6, 2, 2, 6, 6, 2, 6, 18, 6, 6, 6, 2, 2, 6, 6, 2, 2, 6, 2, 6, 2, 10, 18, 2, 2, 2, 2, 2, 18, 2, 2, 2, 2, 2, 6, 18, 2, 6, 6, 2, 6, 6, 6

Offset: 1

Kival Ngaokrajang, Apr 06 2014

nonn

a(n) are even R that give a(n) >= 2, which seems to be nonperiodic, for even R there is no contact point exist. This is the case of A053417.
Sequence A053416 addresses the case in which the center of the R-circle (R = r*n) is chosen at a lattice point instead; in that case, the number of contact points is 0 and 6 for even n > 0 and odd n > 1, respectively.
See illustrations in links.

Kival Ngaokrajang, Illustration R-circle center is at (0.5,0)
Kival Ngaokrajang, Illustration R-circle center is at (0,0)

Cf. A053416, A053417, A239074.

cp's OEIS Frontend

A239073 Given a circle of radius R into which small circles of radius R/2^n are packed in a "hexagonal pattern" (see Comments), a(n) is the maximum number of small circles.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Formula

Extensions

A239206 a(n) is the total number of rows of circles of radius r packing into a circle of radius R, where r = R/2^n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A240501 Given circular disks of radius r in a hexagonal lattice covered by a circular disk of radius R = r*2n, if the center of the circle is chosen at the middle between two lattice points, a(n) is the number of points at which an r-circle is tangent to the R-circle.

Views

Author

Keywords

Comments

Links

Crossrefs