This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A369273 #36 Jan 23 2024 04:03:19 %S A369273 0,5,6,11,12,17,18,24,25,30,31,36,37,42,43,44,49,50,55,56,61,62,68,69, %T A369273 74,75,80,81,86,87,88,93,94,99,100,105,106,112,113,118,119,124,125, %U A369273 130,131,132,137,138,143,144,149,150,156,157,162,163,168,169,174,175,181,182,187,188,193,194 %N A369273 Nonnegative numbers k satisfying sin(k) < sin(k+1) < sin(k+2). %C A369273 Subsequence of terms in A026309: The smaller of two consecutive terms there. %C A369273 The terms A246389(.)-2 almost match the terms here; the exceptions are terms 178, 220, 266, 310, 555, 599, ... in A246389 where the associates 176, 218, 264, 308, ... are not in this sequence. - _Hugo Pfoertner_, Jan 18 2024 %p A369273 isA369273 := proc(k) %p A369273 local s ; %p A369273 s := [seq(evalf(sin(k+i)),i=0..2)] ; %p A369273 if s[1] < s[2] and s[2] < s[3] then %p A369273 true; %p A369273 else %p A369273 false; %p A369273 end if; %p A369273 end proc: %p A369273 A369273 := proc(n) %p A369273 option remember ; %p A369273 if n = 1 then %p A369273 0; %p A369273 else %p A369273 for a from procname(n-1)+1 do %p A369273 if isA369273(a) then %p A369273 return a; %p A369273 end if; %p A369273 end do: %p A369273 end if; %p A369273 end proc: %p A369273 seq(A369273(n),n=1..100) ; %t A369273 Select[Range[0,194], Sin[#]<Sin[#+1]<Sin[#+2]&] (* _James C. McMahon_, Jan 22 2024 *) %Y A369273 Cf. A026309, A369274, A369275. %K A369273 nonn,easy %O A369273 1,2 %A A369273 _R. J. Mathar_, Jan 18 2024