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!)
A247512 The curvature (rounded down) of touching circles inscribed in a special way in the smaller segment of circle of radius 10/9 divided by a chord of length 4/3. 8

%I #17 Dec 20 2017 14:10:00

%S 9,10,13,20,35,64,119,224,428,821,1576,3030,5828,11215,21584,41545,

%T 79968,153931,296306,570371,1097933,2113463,4068308,7831289,15074840,

%U 29018319,55858826,107525476,206981225,398428629,766955420,1476351286,2841903278,5470523390

%N The curvature (rounded down) of touching circles inscribed in a special way in the smaller segment of circle of radius 10/9 divided by a chord of length 4/3.

%C Refer to comment of A240926. This is the companion of A247335. After the first two terms, the curvatures seem to be non-integer.

%C The actual rational curvatures can be computed. See part II of the W. Lang link for the proofs of the statements given in the formula section.

%H G. C. Greubel, <a href="/A247512/b247512.txt">Table of n, a(n) for n = 0..1000</a>

%H Kival Ngaokrajang, <a href="/A247512/a247512_1.pdf">Illustration of initial terms</a>

%H Wolfdieter Lang, <a href="/A247512/a247512_2.pdf">Curvature computation for A247335 and A247512. </a>

%H <a href="/index/Ch#Cheby">Index entries for sequences related to Chebyshev polynomials.</a>

%F From _Wolfdieter Lang_, Sep 30 2014 (Start)

%F a(n) = floor(r(n)) with the rational curvatures r(n) satisfying the one step nonlinear recurrence relation r(n) = (11*r(n-1) - 9 + 20*sqrt((r(n-1) - 9)*r(n-1)/10))/9 with input r(0) = 9. (In the link r(n) is called b'(n).)

%F r(n) = A246643(n)/9^(n-1) = (9/2)*(1 + S(n, 22/9) - (11/9)*S(n-1, 22/9)), n >= 0, with Chebyshev/s S-polynomials (see A049310). 9^n*S(n, 22/9) = A246645(n). See A246643 for more details. (End)

%e The first curvatures r(n) are 9, 10, 121/9, 1690/81, 25921/729, 420250/6561, 7027801/59049, 119508490/531441,... - _Wolfdieter Lang_, Sep 30 2014

%t r[0] := 9; r[n_] := r[n] = (11*r[n - 1] - 9 + 20*Sqrt[(r[n - 1] - 9)*r[n - 1]/10])/9; Table[Floor[r[n]], {n, 0, 30}] (* _G. C. Greubel_, Dec 20 2017 *)

%o (PARI)

%o {

%o r=0.1;print1(floor(9/(10*r)),", ");r1=r;

%o for (n=1,50,

%o if (n<=1,ab=2-r,ab=sqrt(ac^2+r^2));

%o ac=sqrt(ab^2-r^2);

%o if (n<=1,z=0,z=(Pi/2)-atan(ac/r)+asin((r1-r)/(r1+r));r1=r);

%o b=acos(r/ab)-z;

%o r=r*(1-cos(b))/(1+cos(b));

%o print1(floor(9/(10*r)),", ")

%o )

%o }

%Y Cf. A240926, A247335.

%Y Cf. A246643, A049310, A246645. - _Wolfdieter Lang_, Sep 30 2014

%K nonn,easy

%O 0,1

%A _Kival Ngaokrajang_, Sep 18 2014

%E Edited: Keyword easy and Chebyshev index link added. _Wolfdieter Lang_, Sep 30 2014

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 May 5 08:57 EDT 2024. Contains 372264 sequences. (Running on oeis4.)