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!)
 A179396 a(n) = prime(n)^2 modulo prime(n+4). 0
 4, 9, 8, 11, 6, 24, 10, 28, 37, 24, 21, 44, 29, 19, 65, 40, 50, 8, 7, 57, 91, 80, 91, 3, 35, 31, 68, 52, 99, 120, 37, 98, 86, 87, 157, 138, 126, 143, 3, 14, 127, 125, 189, 8, 219, 213, 18, 17, 196, 233, 62, 50, 246, 129, 123, 43, 196, 191, 286, 278, 274, 259, 245, 2, 115, 326, 131, 125, 33, 203, 297, 193, 95, 179 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = A001248(n) mod A000040(n+4). EXAMPLE a(1)=2^2 mod(11)=4 mod(11)=4. a(2)=3^2 mod(13)=9 mod(13)=9. a(3)=5^2 mod(17)=25 mod(17)=8. a(4)=7^2 mod(19)=49 mod(19)=11. PROG (PARI) a(n) = prime(n)^2 % prime(n+4) \\ Michel Marcus, Aug 06 2013 CROSSREFS Cf. A167770. Sequence in context: A276539 A011381 A122824 * A093491 A140808 A163642 Adjacent sequences:  A179393 A179394 A179395 * A179397 A179398 A179399 KEYWORD nonn,easy AUTHOR Umut Uludag, Jan 07 2011 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 18 13:58 EST 2018. Contains 318229 sequences. (Running on oeis4.)