A251535 Bisection A098548(2n+1).

1, 3, 9, 21, 27, 33, 39, 51, 57, 63, 69, 81, 87, 93, 99, 111, 117, 123, 129, 141, 147, 153, 159, 171, 177, 183, 189, 201, 207, 213, 219, 237, 243, 249, 261, 267, 273, 279, 291, 297, 303, 309, 321, 327, 333, 339, 351, 357, 363

Offset: 0

Author

N. J. A. Sloane, Dec 07 2014

Keywords

• nonn

Comments

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

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..100000

Crossrefs

Cf. A098548, A251536.

Programs

Haskell

a251535 n = a251535_list !! n
a251535_list = fst a098548_bisect
a098548_bisect = cleave a098548_list where
   cleave xs = (evens xs, odds xs) where
      evens [] = []; evens [x] = [x]; evens (x:_:xs) = x : evens xs
      odds [] = []; odds [x] = []; odds (_:x:xs) = x : odds xs
-- Reinhard Zumkeller, Dec 08 2014