This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A130139 Let f denote the map that replaces k with the concatenation of its proper divisors, written in increasing order, each divisor being written in base 10 in the normal way. Then a(n) = prime reached when starting at 2n+1 and iterating f. 5
 1, 3, 5, 7, 3, 11, 13, 1129, 17, 19, 37, 23, 5, 313, 29, 31, 311, 1129, 37, 313, 41, 43 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS If 2n+1 is 1 or a prime, set a(n) = 2n+1. If no prime is ever reached, set a(n) = -1. LINKS EXAMPLE n = 7: 2n+1 = 15 = 3*5 -> 35 = 5*7 -> 57 = 3*19 -> 319 = 11*29 -> 1129, prime, so a(7) = 1129. CROSSREFS Cf. A130140, A130141, A130142. A bisection of A120716. Sequence in context: A099984 A130141 A130142 * A204938 A101088 A134487 Adjacent sequences:  A130136 A130137 A130138 * A130140 A130141 A130142 KEYWORD base,more,nonn AUTHOR N. J. A. Sloane, Jul 30 2007 EXTENSIONS The value of a(22) is currently unknown. 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 December 11 10:48 EST 2018. Contains 318049 sequences. (Running on oeis4.)