cp's OEIS Frontend

A251535 Bisection A098548(2n+1).

%I A251535 #19 Dec 07 2019 20:44:59
%S A251535 1,3,9,21,27,33,39,51,57,63,69,81,87,93,99,111,117,123,129,141,147,
%T A251535 153,159,171,177,183,189,201,207,213,219,237,243,249,261,267,273,279,
%U A251535 291,297,303,309,321,327,333,339,351,357,363
%N A251535 Bisection A098548(2n+1).
%C A251535 For a given n>0, imagine a continuously-running wall clock that chimes once every a(n) minutes. Let m equal the number of distinct minute marks the minute hand would point to over the course of time at each chime. This sequence defines the values of a(n) for m=20. An example of this sequence is depicted in Battlestar Galactica Season 1 Episode 1 "33" (from 2004) with a(5)=33. - _David Martin_, Nov 26 2019
%H A251535 Reinhard Zumkeller, <a href="/A251535/b251535.txt">Table of n, a(n) for n = 0..100000</a>
%o A251535 (Haskell)
%o A251535 a251535 n = a251535_list !! n
%o A251535 a251535_list = fst a098548_bisect
%o A251535 a098548_bisect = cleave a098548_list where
%o A251535    cleave xs = (evens xs, odds xs) where
%o A251535       evens [] = []; evens [x] = [x]; evens (x:_:xs) = x : evens xs
%o A251535       odds [] = []; odds [x] = []; odds (_:x:xs) = x : odds xs
%o A251535 -- _Reinhard Zumkeller_, Dec 08 2014
%Y A251535 Cf. A098548, A251536.
%K A251535 nonn
%O A251535 0,2
%A A251535 _N. J. A. Sloane_, Dec 07 2014