Split-floor-multiplier sequence (SFMS) using multipliers 1/3 and 3. The SFMS using multipliers r and s is here introduced: for every positive integer n and positive real number r, let [rn] abbreviate floor(rn). Then SFMS(r, s), where max {r, s}>1, is the sequence a defined by a(n)=[rn] if [rn]>0 and is not already in a and a(n)=[sn] otherwise.

Responses to message "Murthy's sequence A073675" to seqfan(AT)ext.jussieu.fr. The message and responses are dated Feb 02 2006 and relate to generalizations and properties of sequence A073675, which is SFMS(1/2,2).