|
|
A261469
|
|
a(n) = prime(n+3) mod prime(n).
|
|
1
|
|
|
1, 2, 3, 3, 8, 10, 12, 12, 14, 12, 12, 10, 12, 16, 14, 14, 12, 12, 12, 12, 16, 18, 18, 14, 10, 8, 10, 20, 22, 24, 12, 18, 14, 18, 14, 16, 16, 16, 14, 18, 14, 16, 8, 18, 26, 28, 18, 10, 12, 12, 18, 18, 22, 18, 14, 14, 12, 12, 16, 26, 28, 20, 10, 20, 24, 30, 18, 16, 12
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = prime(n+3) mod prime(n).
|
|
EXAMPLE
|
a(3) = 13 mod 5 = 3.
|
|
MATHEMATICA
|
a[n_]:=PowerMod[Prime[n + 3], 1, Prime[n]]; Table[a[n], {n, 80}] (* Vincenzo Librandi, Aug 20 2015 *)
Mod[Last[#], First[#]]&/@Partition[Prime[Range[80]], 4, 1] (* Harvey P. Dale, Jun 23 2017 *)
|
|
PROG
|
(PARI) first(m)=vector(m, i, prime(i+3)%prime(i)) \\ Anders Hellström, Aug 20 2015
(Magma) [NthPrime(n+3) mod NthPrime(n): n in [1.. 70]]; // Vincenzo Librandi, Aug 20 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,less
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|