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!)
A172448 a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ... 2

%I #16 Aug 16 2019 22:52:34

%S 1,2,8,33,344,1054,1764,2474,3184,3894,4604,5314,6024,6734,7444,8154,

%T 8864,9574,10284,10994,11704,12414,13124,13834,14544,15254,15964,

%U 16674,17384,18094,18804,19514,20224,20934,21644,22354,23064,23774,24484

%N a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...

%D J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 83, p. 29, Ellipses, Paris 2008. Also Entry 137, p. 47.

%H Amiram Eldar, <a href="/A172448/b172448.txt">Table of n, a(n) for n = 1..89</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Pi.html">Pi</a>.

%e 1/cos(1) = 1.8508157..., 1/cos(2) = -2.402997962..., 1/cos(8) = -6.8728506...

%p a:= evalf(1/ cos(1)); for n from 2 to 10000000 do; if a > evalf(1/cos(n)) then a:= evalf(1/cos(n)); print(n); else fi ; od;

%t am = 2; s = {}; Do[a = 1/Cos[n]; If[a < am, am = a; AppendTo[s, n]], {n, 1, 10^4}]; s (* _Amiram Eldar_, Aug 16 2019 *)

%Y Cf. A172446.

%K nonn

%O 1,2

%A _Michel Lagneau_, Feb 03 2010

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 April 24 06:52 EDT 2024. Contains 371920 sequences. (Running on oeis4.)