cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

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
Offset: 2

Views

Author

Arkadiusz Wesolowski, Mar 12 2017

Keywords

Crossrefs

Programs

  • 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;