Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A120229

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A120229 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.
(history; published version)
#19 by Olivier Gérard at Sun Jan 15 01:54:40 EST 2023
STATUS

editing

approved

#18 by Olivier Gérard at Sun Jan 15 01:53:52 EST 2023
REFERENCES

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

LINKS

<a href="http://list.seqfan.eu/oldermail/seqfan-old/2006-February/007226.html">Seqfan: about Murthy's sequence A073675 (1)</a>

<a href="http://list.seqfan.eu/oldermail/seqfan-old/2006-February/007228.html">Seqfan: about Murthy's sequence A073675 (2)</a>

<a href="http://list.seqfan.eu/oldermail/seqfan-old/2006-February/007232.html">Seqfan: about Murthy's sequence A073675 (3)</a>

STATUS

approved

editing

#17 by Sean A. Irvine at Sat Mar 28 15:50:20 EDT 2020
STATUS

reviewed

approved

#16 by Michel Marcus at Fri Mar 06 01:06:11 EST 2020
STATUS

proposed

reviewed

#15 by Jon E. Schoenfield at Thu Mar 05 19:46:04 EST 2020
STATUS

editing

proposed

#14 by Jon E. Schoenfield at Thu Mar 05 19:46:01 EST 2020
NAME

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.

FORMULA

a(n)=[) = [n/3] if this is positive and new, elseotherwise a(n)=3n.

EXAMPLE

a(1)=) = 1*3 because [1/3] is not positive.

a(2)=) = 2*3 because [2/3] is not positive.

a(3)=) = 1=[ = [3*(1/3)].

a(4)=) = 4*3 because [4/3]=] = a(3), not new.

STATUS

reviewed

editing

#13 by Joerg Arndt at Thu Mar 05 11:04:37 EST 2020
STATUS

proposed

reviewed

#12 by Peter Munn at Thu Mar 05 10:29:02 EST 2020
STATUS

editing

proposed

#11 by Peter Munn at Thu Mar 05 09:46:51 EST 2020
LINKS

<a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

STATUS

approved

editing

#10 by Michel Marcus at Sun Mar 31 03:44:40 EDT 2019
STATUS

reviewed

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 8 16:32 EDT 2024. Contains 375753 sequences. (Running on oeis4.)