The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066937 For n=1,2,3,..., define b(n) as follows: initialize v at v=n; then for k=2,3,4,..., if v>0 and k divides v, replace v with v-k. Set b(n)=v. Then {a(n)} is the subsequence consisting of the nonzero terms of {b(n)}. 1
 1, 2, 3, 4, 5, 7, 6, 8, 11, 10, 13, 9, 17, 12, 19, 14, 23, 16, 20, 15, 29, 31, 22, 18, 25, 21, 26, 37, 24, 41, 43, 27, 34, 28, 47, 32, 38, 53, 35, 40, 33, 59, 44, 30, 61, 46, 49, 50, 39, 67, 42, 71, 36, 73, 58, 55, 79, 52, 48, 62, 83, 65, 51, 45, 89, 56, 57, 74, 97, 101, 103 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A permutation of the positive integers. LINKS Ivan Neretin, Table of n, a(n) for n = 1..10000 MATHEMATICA terms = 71; m0 = 400; dm = 200; Clear[f]; f[m_] := f[m] = (r = Range[m]; Do[r = r /. {n_ /; n > 0 && Mod[n, k] == 0 :> n - k }, {k, 2, Floor[m/2]}]; DeleteCases[r, 0] [[1 ;; terms]]); f[m0]; f[m = m0 + dm]; While[f[m] != f[m - dm], m = m + dm]; f[m] (* Jean-François Alcover, Mar 20 2013 *) CROSSREFS Sequence in context: A056017 A091995 A338698 * A217266 A209637 A120750 Adjacent sequences:  A066934 A066935 A066936 * A066938 A066939 A066940 KEYWORD nonn AUTHOR John W. Layman, Jan 24 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 5 19:09 EDT 2021. Contains 343573 sequences. (Running on oeis4.)