The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248520 Numbers k such that floor(cot(Pi/(2k+2))) = floor(cot(Pi/(2k))). 2
 2, 5, 8, 10, 13, 16, 19, 21, 24, 27, 30, 32, 35, 38, 41, 43, 46, 49, 52, 55, 57, 60, 63, 66, 68, 71, 74, 77, 79, 82, 85, 88, 90, 93, 96, 99, 101, 104, 107, 110, 112, 115, 118, 121, 123, 126, 129, 132, 134, 137, 140, 143, 145, 148, 151, 154, 156, 159, 162 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 FORMULA Conjecture: a(n) ~ Pi/(Pi-2) * n. - Vaclav Kotesovec, Oct 09 2014 EXAMPLE ([cot(Pi/(2k+2))] = [cot(Pi/(2k))]) = (1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0,...), so that A248520 = (2, 5, 8, 10, 13, 16, ...) and A248521 = (1, 3, 4, 6, 7, 9, 11, ...). MATHEMATICA z = 240; v = Table[Floor[Cot[Pi/(2 n)]], {n, 1, z}]; Flatten[Position[Differences[v], 0]] (* A248520 *) Flatten[Position[Differences[v], 1]] (* A248521 *) nmax=200; Select[Range[nmax], Floor[Cot[Pi/(2#+2)]]==Floor[Cot[Pi/(2#)]]&] (* Vaclav Kotesovec, Oct 09 2014 *) CROSSREFS Cf. A248521, A033581. Sequence in context: A054088 A186540 A059556 * A247780 A189365 A024509 Adjacent sequences: A248517 A248518 A248519 * A248521 A248522 A248523 KEYWORD nonn,easy AUTHOR Clark Kimberling, Oct 08 2014 STATUS approved

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.

Last modified April 15 04:34 EDT 2024. Contains 371667 sequences. (Running on oeis4.)