A140353 -id:A140353 - cp's OEIS frontend

A052147 a(n) = prime(n) + 2.

4, 5, 7, 9, 13, 15, 19, 21, 25, 31, 33, 39, 43, 45, 49, 55, 61, 63, 69, 73, 75, 81, 85, 91, 99, 103, 105, 109, 111, 115, 129, 133, 139, 141, 151, 153, 159, 165, 169, 175, 181, 183, 193, 195, 199, 201, 213, 225, 229, 231, 235, 241, 243, 253, 259

Offset: 1

Simon Colton (simonco(AT)cs.york.ac.uk), Jan 24 2000

A048974, A052147, A067187 and A088685 are very similar after dropping terms less than 13. - Eric W. Weisstein, Oct 10 2003
A117530(n,2) = a(n) for n>1. - Reinhard Zumkeller, Mar 26 2006
a(n) = A000040(n) + 2 = A008864(n) + 1 = A113395(n) - 1 = A175221(n) - 2 = A175222(n) - 3 = A139049(n) - 4 = A175223(n) - 5 = A175224(n) - 6 = A140353(n) - 7 = A175225(n) - 8. - Jaroslav Krizek, Mar 06 2010
Left edge of the triangle in A065342. - Reinhard Zumkeller, Jan 30 2012
Union of A006512 and A107986. - David James Sycamore, Jul 08 2018

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

A139690 is a subsequence.

Cf. A040976, A000040.

Filtered([1..300], k-> IsPrime(k) ) + 2; # G. C. Greubel, May 20 2019

a052147 = (+ 2) . a000040  -- Reinhard Zumkeller, Jul 03 2015

[p+2: p in PrimesUpTo(400)]; // Vincenzo Librandi, Nov 27 2013

seq(ithprime(n)+2,n=1..55); # Muniru A Asiru, Jul 08 2018

Prime[Range[70]]+2 (* Vladimir Joseph Stephan Orlovsky, Apr 29 2008 *)

a(n)=prime(n)+2 \\ Charles R Greathouse IV, Jan 19 2017

[nth_prime(n) +2 for n in (1..70)] # G. C. Greubel, May 20 2019

A113935 a(n) = prime(n) + 3.

Original entry on oeis.org

5, 6, 8, 10, 14, 16, 20, 22, 26, 32, 34, 40, 44, 46, 50, 56, 62, 64, 70, 74, 76, 82, 86, 92, 100, 104, 106, 110, 112, 116, 130, 134, 140, 142, 152, 154, 160, 166, 170, 176, 182, 184, 194, 196, 200, 202, 214, 226, 230, 232, 236, 242, 244, 254, 260, 266, 272, 274

Offset: 1

Jorge Coveiro, Jan 30 2006

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

Cf. A098090, A116366.

List([1..70], n-> Primes[n]+3); # G. C. Greubel, May 18 2019

[p+3: p in PrimesUpTo(500)]; // Vincenzo Librandi, Nov 27 2013

Prime[Range[70]]+3 (* Vladimir Joseph Stephan Orlovsky, Apr 29 2008 *)

PARI
```
for(x=1,100,print1(prime(x)+3,","))
```

[nth_prime(n)+3 for n in (1..70)] # G. C. Greubel, May 18 2019

a(n) = A116366(n-1,1) for n>1. - Reinhard Zumkeller, Feb 06 2006
a(n) = 2*A098090(n-1) for n > 1. - Reinhard Zumkeller, Sep 14 2006
a(n) = A000040(n) + 3 = A008864(n) + 2 = A052147(n) + 1 = A175221(n) - 1 = A175222(n) - 2 = A139049(n) - 3 = A175223(n) - 4 = A175224(n) - 5 = A140353(n) - 6 = A175225(n) - 7. - Jaroslav Krizek, Mar 06 2010

A175222 a(n) = prime(n) + 5.

Original entry on oeis.org

7, 8, 10, 12, 16, 18, 22, 24, 28, 34, 36, 42, 46, 48, 52, 58, 64, 66, 72, 76, 78, 84, 88, 94, 102, 106, 108, 112, 114, 118, 132, 136, 142, 144, 154, 156, 162, 168, 172, 178, 184, 186, 196, 198, 202, 204, 216, 228, 232, 234, 238, 244, 246, 256, 262, 268, 274, 276

Offset: 1

Jaroslav Krizek, Mar 06 2010

a(n) = A000040(n) + 5 = A008864(n) + 4 = A052147(n) + 3 = A113395(n) + 2 = A175221 (n) + 1 = A139049(n) - 1 = A175223(n) - 2 = A175224(n) - 3 = A140353(n) - 4 = A175225(n) - 5.

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

Cf. A000040, A008864, A052147, A086801, A113395, A113935, A139049, A140353, A175221, A175223, A175224, A175225.

Filtered([1..300], k-> IsPrime(k) ) + 5; # G. C. Greubel, May 20 2019

[p+5: p in PrimesUpTo(500)]; // Vincenzo Librandi, Dec 04 2010

Prime[Range[120]]+5 (* Vladimir Joseph Stephan Orlovsky, Nov 21 2010 *)

{a(n) = prime(n) + 5}; \\ G. C. Greubel, May 20 2019

[nth_prime(n) + 5 for n in (1..100)] # G. C. Greubel, May 20 2019

More terms from Vincenzo Librandi, Mar 14 2010

A175221 a(n) = prime(n) + 4.

Original entry on oeis.org

6, 7, 9, 11, 15, 17, 21, 23, 27, 33, 35, 41, 45, 47, 51, 57, 63, 65, 71, 75, 77, 83, 87, 93, 101, 105, 107, 111, 113, 117, 131, 135, 141, 143, 153, 155, 161, 167, 171, 177, 183, 185, 195, 197, 201, 203, 215, 227, 231, 233, 237, 243, 245, 255, 261, 267, 273, 275

Offset: 1

Jaroslav Krizek, Mar 06 2010

nonn

G. C. Greubel, Table of n, a(n) for n = 1..10000

Filtered([1..300], k-> IsPrime(k) ) + 4; # G. C. Greubel, May 20 2019

[(p+4):p in PrimesUpTo(500)]; // Vincenzo Librandi, Dec 04 2010

Prime[Range[60]]+4 (* Harvey P. Dale, Jan 01 2013 *)

{a(n) = prime(n) + 4}; \\ G. C. Greubel, May 20 2019

[nth_prime(n) + 4 for n in (1..60)] # G. C. Greubel, May 20 2019

a(n) = A000040(n) + 4 = A008864(n) + 3 = A052147(n) + 2 = A113395(n) + 1.
a(n) = A175222(n) - 1 = A139049(n) - 2 = A175223(n) - 3.
a(n) = A175224(n) - 4 = A140353(n) - 5 = A175225(n) - 6.

More terms from Vincenzo Librandi, Mar 14 2010

A139049 a(n) = prime(n) + 6.

Original entry on oeis.org

8, 9, 11, 13, 17, 19, 23, 25, 29, 35, 37, 43, 47, 49, 53, 59, 65, 67, 73, 77, 79, 85, 89, 95, 103, 107, 109, 113, 115, 119, 133, 137, 143, 145, 155, 157, 163, 169, 173, 179, 185, 187, 197, 199, 203, 205, 217, 229, 233, 235, 239, 245, 247, 257, 263, 269, 275, 277

Offset: 1

Odimar Fabeny, Jun 02 2008

a(n) = A000040(n) + 6 = A008864(n) + 5 = A052147(n) + 4 = A113395(n) + 3 = A175221(n) + 2 = A175222(n) + 1 = A175223(n) - 1 = A175224(n) - 2 = A140353(n) - 3 = A175225(n) - 4. - Jaroslav Krizek, Mar 06 2010

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A140353.

Filtered([1..300], k-> IsPrime(k) ) + 6; # G. C. Greubel, May 20 2019

[NthPrime(n)+6: n in [1..70]]; // G. C. Greubel, May 20 2019

A139049:=n->ithprime(n)+6: seq(A139049(n), n=1..100); # Wesley Ivan Hurt, Apr 18 2017

6+Prime[Range[70]] (* G. C. Greubel, May 20 2019 *)

PARI
```
A139049(n) = prime(n)+6
```

[nth_prime(n) +6 for n in (1..70)] # G. C. Greubel, May 20 2019

Edited by Michael B. Porter, Jan 28 2010

A175223 a(n) = prime(n) + 7.

Original entry on oeis.org

9, 10, 12, 14, 18, 20, 24, 26, 30, 36, 38, 44, 48, 50, 54, 60, 66, 68, 74, 78, 80, 86, 90, 96, 104, 108, 110, 114, 116, 120, 134, 138, 144, 146, 156, 158, 164, 170, 174, 180, 186, 188, 198, 200, 204, 206, 218, 230, 234, 236, 240, 246, 248, 258, 264, 270, 276, 278

Offset: 1

Jaroslav Krizek, Mar 06 2010

a(n) = A000040(n) + 7 = A008864(n) + 6 = A052147(n) + 5 = A113395(n) + 4 = A175221(n) + 3 = A175222 (n) + 2 = A139049(n) + 1 = A175224(n) - 1 = A140353(n) - 2 = A175225(n) - 3.

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

Filtered([1..300], k-> IsPrime(k) ) + 7; # G. C. Greubel, May 20 2019

[p+7: p in PrimesUpTo(500)]; // Vincenzo Librandi, Dec 04 2010

Prime[Range[70]] + 7 (* Vincenzo Librandi, Nov 27 2013 *)

{a(n) = prime(n) + 7}; \\ G. C. Greubel, May 20 2019

[nth_prime(n) + 7 for n in (1..70)] # G. C. Greubel, May 20 2019

More terms from Vincenzo Librandi, Mar 14 2010

A175224 a(n) = prime(n) + 8.

Original entry on oeis.org

10, 11, 13, 15, 19, 21, 25, 27, 31, 37, 39, 45, 49, 51, 55, 61, 67, 69, 75, 79, 81, 87, 91, 97, 105, 109, 111, 115, 117, 121, 135, 139, 145, 147, 157, 159, 165, 171, 175, 181, 187, 189, 199, 201, 205, 207, 219, 231, 235, 237, 241, 247, 249, 259, 265, 271, 277, 279

Offset: 1

Jaroslav Krizek, Mar 06 2010

nonn

a(n) = A000040(n) + 8 = A008864(n) + 7 = A052147(n) + 6 = A113395(n) + 5 = A175221(n) + 4 = A175222(n) + 3 = A139049(n) + 2 = A175223(n) + 1 = A140353(n) - 1 = A175225(n) - 2.

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A000040, A008864, A052147, A113395, A175221, A175222, A139049, A175223, A140353, A175225.

Filtered([1..300], k-> IsPrime(k) ) + 8; # G. C. Greubel, May 20 2019

[(p+8): p in PrimesUpTo(500)]; // Vincenzo Librandi, Dec 04 2010

Prime[Range[60]]+8 (* Harvey P. Dale, Mar 02 2015 *)

{a(n) = prime(n) + 8}; \\ G. C. Greubel, May 20 2019

[nth_prime(n) + 8 for n in (1..60)] # G. C. Greubel, May 20 2019

More terms from Vincenzo Librandi, Mar 14 2010

A175225 a(n) = prime(n) + 10.

Original entry on oeis.org

12, 13, 15, 17, 21, 23, 27, 29, 33, 39, 41, 47, 51, 53, 57, 63, 69, 71, 77, 81, 83, 89, 93, 99, 107, 111, 113, 117, 119, 123, 137, 141, 147, 149, 159, 161, 167, 173, 177, 183, 189, 191, 201, 203, 207, 209, 221, 233, 237, 239, 243, 249, 251, 261, 267, 273, 279, 281

Offset: 1

Jaroslav Krizek, Mar 06 2010

nonn

a(n) = A000040(n) + 10 = A008864(n) + 9 = A052147(n) + 8 = A113395(n) + 7 = A175221(n) + 6 = A175222(n) + 5 = A139049(n) + 4 = A175223(n) + 3 = A175224(n) + 2 = A140353(n) + 1.

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A000040, A008864, A052147, A113395, A139049, A140353, A175221, A175222, A175223, A175224.

Filtered([1..300], k-> IsPrime(k) ) + 10; # G. C. Greubel, May 21 2019

[(p+10):p in PrimesUpTo(500)]; // Vincenzo Librandi, Dec 04 2010

10 + Prime[Range[70]] (* G. C. Greubel, May 21 2019 *)

{a(n) = prime(n) + 10}; \\ G. C. Greubel, May 21 2019

[nth_prime(n) + 10 for n in (1..70)] # G. C. Greubel, May 21 2019

More terms from Vincenzo Librandi, Mar 14 2010

A379208 Numbers k such that prime(k) and prime(k) + 9 are anagrams.

Original entry on oeis.org

9, 19, 24, 26, 39, 48, 73, 77, 79, 91, 99, 110, 126, 143, 163, 188, 197, 200, 209, 212, 219, 224, 237, 241, 247, 252, 262, 269, 278, 279, 281, 285, 290, 291, 316, 336, 355, 360, 365, 391, 403, 405, 408, 431, 434, 439, 442, 448, 464, 468, 477, 486, 507, 517, 524, 531, 539, 544, 549, 550, 551, 575, 589, 602, 615

Offset: 1

Vincenzo Librandi, Dec 18 2024

			9 is a term of the sequence because prime(9) = 23 and 23 + 9 = 32 are anagrams.

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A140353, A228157.

[n: n in [0..2000] | Sort(Intseq(NthPrime(n))) eq Sort(Intseq(NthPrime(n) + 9))];

filter:= proc(k) local p;
  p:= ithprime(k);
  sort(convert(p,base,10)) = sort(convert(p+9,base,10))
end proc:
select(filter, [$1..1000]); # Robert Israel, Jan 18 2025

Select[Range[3000],Sort[IntegerDigits[Prime[#]]]==Sort[IntegerDigits[Prime[#]+9]]&]

is(n) = my(p = prime(n)); vecsort(digits(p)) == vecsort(digits(p+9)) \\ David A. Corneth, Dec 18 2024

Name corrected by David A. Corneth, Dec 18 2024

A382118 Prime indices k such that prime(k) and prime(k) + 9 are anagrams.

Original entry on oeis.org

19, 73, 79, 163, 197, 241, 269, 281, 431, 439, 619, 647, 691, 739, 751, 761, 823, 877, 953, 1019, 1051, 1109, 1223, 1259, 1291, 1307, 1423, 1471, 1723, 1741, 1747, 1847, 1949, 1979, 2213, 2371, 2473, 2503, 2647, 2789, 2803, 2819, 2879, 2903, 2909, 3019, 3163, 3361

Offset: 1

Vincenzo Librandi, Apr 15 2025

Primes in A379208.

			The prime 19 is a term of the sequence because prime(19)= 67 and 67 + 9 = 76 are anagrams.

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

Cf. A140353, A228157, A379208.

[n: n in [0..10000] | IsPrime(n) and Sort(Intseq(NthPrime(n))) eq Sort(Intseq(NthPrime(n) + 9))];

Select[Prime[Range[500]],Sort[IntegerDigits[Prime[#]]]==Sort[IntegerDigits[Prime[#]+9]]&]

cp's OEIS Frontend

A052147 a(n) = prime(n) + 2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Sage

A113935 a(n) = prime(n) + 3.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

A175222 a(n) = prime(n) + 5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Extensions

A175221 a(n) = prime(n) + 4.

Views

Author

Keywords

Links

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

Extensions

A139049 a(n) = prime(n) + 6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Extensions

A175223 a(n) = prime(n) + 7.

Views

Author

Keywords

Comments

Links

Programs

GAP

Magma