This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A242901 Smallest m such that A242885(m) = n. 2
 1, 2, 6, 4, 10, 26, 46, 50, 36, 22, 110, 52, 88, 14, 140, 16, 34, 32, 76, 44, 168, 106, 146, 104, 100, 38, 522, 196, 64, 130, 3256, 224, 280, 94, 308, 526, 400, 266, 1026, 250, 386, 86, 298, 212, 438, 466, 674, 208, 1666, 200, 1236, 304, 424, 202, 550, 728 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A242885(a(n)) = n and A242885(m) <> n for m < a(n); n + a(n) is a divisor of n^n + a(n)^a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..660 EXAMPLE n = 3: a(3) = 6, 3^3 + 6^6 = 46683 = (3+6) * 5187; n = 4: a(4) = 4, 4^4 + 4^4 = 512 = (4+4) * 64; n = 5: a(5) = 10, 5^5 + 10^10 = 10000003125 = (5+10) * 666666875; n = 6: a(6) = 26, 6^6 + 26^26 = 6156119580207157310796674288400250432 = (6+26) * 192378736881473665962396071512507826. PROG (Haskell) a242901 = (+ 1) . fromJust . (`elemIndex` a242885_list) CROSSREFS Sequence in context: A065879 A065880 A090546 * A266013 A222423 A059909 Adjacent sequences:  A242898 A242899 A242900 * A242902 A242903 A242904 KEYWORD nonn AUTHOR Reinhard Zumkeller, May 25 2014 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 8 18:37 EST 2019. Contains 329865 sequences. (Running on oeis4.)