The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183993 "Types" (parities of i and j) when all the numbers i+j*r are ranked, where r=golden ratio, i>=0, j>=0. 9
 4, 2, 3, 4, 1, 2, 4, 3, 4, 2, 1, 3, 2, 4, 3, 1, 4, 2, 4, 1, 3, 2, 4, 2, 3, 1, 4, 3, 2, 4, 1, 3, 2, 1, 4, 2, 3, 4, 1, 4, 3, 2, 4, 1, 2, 3, 2, 1, 4, 3, 2, 3, 4, 1, 4, 3, 2, 1, 4, 1, 2, 3, 4, 2, 1, 4, 3, 2, 3, 4, 1, 2, 4, 3, 2, 1, 4, 3, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES Mohammad K. Azarian, Problem 123, Missouri Journal of Mathematical Sciences, Vol. 10, No. 3, Fall 1998, p. 176. Solution published in Vol. 12, No. 1, Winter 2000, pp. 61-62. LINKS FORMULA Let s(n)=i(n)+r*j(n) be the sequence obtained by arranging in increasing order all the numbers i+j*r, where r is the golden mean ((1+sqrt(5))/2), and i>=0, j>=0. Then a(n)=1 if i(n) is odd and j(n) is odd (n in A183989); a(n)=2 if i(n) is odd and j(n) is even (n in A183990); a(n)=3 if i(n) is even and j(n) is odd (n in A183991); a(n)=4 if i(n) is even and j(n) is even (n in A183992). EXAMPLE (See the examples at A183989-A183992.) CROSSREFS Cf. A183987, A183988, A183989, A183990, A183991, A183992. Sequence in context: A226087 A118945 A016692 * A184403 A198120 A001390 Adjacent sequences: A183990 A183991 A183992 * A183994 A183995 A183996 KEYWORD nonn AUTHOR Clark Kimberling, Jan 08 2011 EXTENSIONS I edited the definition slightly. - N. J. A. Sloane, Jan 11 2011 STATUS 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.

Last modified November 30 21:57 EST 2022. Contains 358453 sequences. (Running on oeis4.)