The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267573 a(n) = prime(n) + (prime(n) mod 4). 1
 4, 6, 6, 10, 14, 14, 18, 22, 26, 30, 34, 38, 42, 46, 50, 54, 62, 62, 70, 74, 74, 82, 86, 90, 98, 102, 106, 110, 110, 114, 130, 134, 138, 142, 150, 154, 158, 166, 170, 174, 182, 182, 194, 194, 198, 202, 214, 226, 230, 230, 234, 242, 242, 254, 258, 266, 270 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The primes corresponding to the cases where a(n) = a(n+1) can be found in A071698. - Michel Marcus, Jan 17 2016 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A000040(n) + A039702(n). a(n) = A083220(prime(n)). - Michel Marcus, Jan 17 2016 EXAMPLE p=19; 19 + (19 modulo 4) = 22. MAPLE A267573:=n->ithprime(n)+(ithprime(n) mod 4): seq(A267573(n), n=1..100); # Wesley Ivan Hurt, Jan 17 2016 MATHEMATICA Table[Prime[n] + Mod[Prime[n], 4], {n, 60}] (* Vincenzo Librandi, Jan 17 2016 *) #+Mod[#, 4]&/@Prime[Range[60]] (* Harvey P. Dale, Jun 12 2020 *) PROG (MAGMA) [NthPrime(n)+(NthPrime(n) mod 4): n in [1..100]]; // Vincenzo Librandi, Jan 17 2016 (PARI) a(n) = prime(n) + (prime(n) % 4); \\ Michel Marcus, Jan 17 2016 (PARI) lista(nn) = forprime(p=2, nn, print1(p + p % 4, ", ")); \\ Altug Alkan, Jan 17 2016 CROSSREFS Cf. A000040, A039702, A071698, A083220. Sequence in context: A058640 A075653 A075656 * A345282 A193814 A304409 Adjacent sequences:  A267570 A267571 A267572 * A267574 A267575 A267576 KEYWORD nonn,easy AUTHOR Emre APARI, Jan 17 2016 EXTENSIONS More terms from Vincenzo Librandi, Jan 17 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 15:10 EDT 2022. Contains 356066 sequences. (Running on oeis4.)