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!)
 A283622 a(n) = smallest k > n + 1 not of the form p + n^x with p prime, where gcd(k, n) = 1 and gcd(k-1, n-1) = 1. 1
 127, 328, 149, 26, 127, 254, 17, 34, 59, 50, 37, 134, 23, 136, 65, 26, 43, 96, 29, 142, 47, 50, 49, 116, 35, 52, 53, 56, 79, 122, 41, 58, 59, 92, 157, 86, 47, 64, 89, 50, 67, 186, 53, 94, 95, 56, 73, 134, 59, 100, 77, 78, 79, 146, 65, 82, 83, 86, 109, 204, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS PROG (MAGMA) lst:=[]; for n in [2..62] do k:=n+2; t:=0; while t eq 0 do if GCD(k, n) eq 1 and GCD(k-1, n-1) eq 1 then x:=-1; repeat x+:=1; p:=k-n^x; until p lt 2 or IsPrime(p); if p lt 2 then Append(~lst, k); t:=1; end if; end if; k+:=1; end while; end for; lst; CROSSREFS Cf. A006285, A282430. Sequence in context: A157949 A142165 A031933 * A080035 A162004 A112419 Adjacent sequences:  A283619 A283620 A283621 * A283623 A283624 A283625 KEYWORD nonn AUTHOR Arkadiusz Wesolowski, Mar 12 2017 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 12 18:37 EST 2018. Contains 318081 sequences. (Running on oeis4.)