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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185635 Fixed points of A075075. 3
 1, 2, 8, 36, 39, 49, 370, 626, 632, 1030, 13155, 32317, 61358, 86704, 2535431, 13360009 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A075075(a(n)) = A160516(a(n)) = a(n); A075075(a(n)-1) * A075075(a(n)+1) mod a(n) = 0. LINKS Table of n, a(n) for n=1..16. PROG (Haskell) a185635 n = a185635_list !! (n-1) a185635_list = filter (> 0) \$ zipWith (\x y -> if x == y then y else 0) [1..] a075075_list -- Reinhard Zumkeller, Dec 19 2012 (Python) from __future__ import division from fractions import gcd A185635_list, l1, l2, m, b = [1, 2], 2, 1, 2, {1, 2} for n in range(3, 10**4): ....i = m ....while True: ........if not i in b: ............if n == i: ................A185635_list.append(i) ............l1, l2, m = i, l1, i//gcd(l1, i) ............b.add(i) ............break ........i += m # Chai Wah Wu, Dec 09 2014 CROSSREFS Sequence in context: A007508 A122674 A203762 * A076122 A332607 A236626 Adjacent sequences: A185632 A185633 A185634 * A185636 A185637 A185638 KEYWORD nonn,more AUTHOR Reinhard Zumkeller, Dec 19 2012 EXTENSIONS a(15) from Chai Wah Wu, Dec 10 2014 a(16) from Chai Wah Wu, Sep 22 2019 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 December 10 15:23 EST 2023. Contains 367713 sequences. (Running on oeis4.)