login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072565 a(n) = prime(n+1)*prime(n+2)+1 mod prime(n), where prime(n) is the n-th prime. 2
0, 0, 3, 4, 2, 12, 13, 3, 3, 17, 30, 25, 13, 41, 26, 49, 17, 0, 25, 17, 61, 41, 2, 8, 25, 13, 25, 13, 73, 27, 41, 49, 25, 121, 17, 73, 61, 41, 73, 49, 25, 121, 13, 25, 29, 90, 193, 25, 13, 41, 49, 25, 161, 73, 73, 49, 17, 61, 25, 25, 241, 253, 25, 13, 73, 281, 97, 121, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

REFERENCES

R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer-Verlag, NY, (2002 printing), Research problem 1.85, p. 73.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

FORMULA

a(n) = A023523(n+1) mod A000040(n). - Michel Marcus, Feb 28 2018

EXAMPLE

a(18) = prime(19)*prime(20)+1 mod prime(18) = 67*71+1 mod 61 = 0.

MAPLE

p:=ithprime; seq((p(n+1)*p(n+2)+1) mod p(n), n=1..70); # Muniru A Asiru, Mar 09 2018

MATHEMATICA

a[n_] := Mod[Prime[n+1] Prime[n+2] + 1, Prime[n]]

Mod[#[[2]]#[[3]]+1, #[[1]]]&/@Partition[Prime[Range[80]], 3, 1] (* Harvey P. Dale, Dec 19 2018 *)

PROG

(PARI) a(n) = (prime(n+1)*prime(n+2) + 1) % prime(n); \\ Michel Marcus, Feb 28 2018

(MAGMA) [(NthPrime(n+1)*NthPrime(n+2)+1) mod NthPrime(n): n in [1..100]]; // Vincenzo Librandi, Feb 28 2018

(GAP) P:=Filtered([1..1000], IsPrime);;

List([1..70], n->(P[n+1]*P[n+2]+1) mod P[n]); # Muniru A Asiru, Mar 09 2018

CROSSREFS

Cf. A000040, A023523, A022461.

Sequence in context: A145421 A286681 A019474 * A159672 A059114 A246322

Adjacent sequences:  A072562 A072563 A072564 * A072566 A072567 A072568

KEYWORD

nonn

AUTHOR

G. L. Honaker, Jr., Aug 06 2002

EXTENSIONS

Edited by Dean Hickerson and Robert G. Wilson v, Aug 10 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 20 11:28 EDT 2019. Contains 325180 sequences. (Running on oeis4.)