A274022 -id:A274022 - cp's OEIS frontend

A085382 Sum of p = prime(n) and largest prime divisor of p-1.

5, 7, 10, 16, 16, 19, 22, 34, 36, 36, 40, 46, 50, 70, 66, 88, 66, 78, 78, 76, 92, 124, 100, 100, 106, 120, 160, 112, 120, 134, 144, 154, 162, 186, 156, 170, 166, 250, 216, 268, 186, 210, 196, 204, 210, 218, 260, 340, 248, 262, 256, 246, 256, 259, 394, 336, 276, 300

Offset: 2

Cino Hilliard, Aug 12 2003

			a(2) = prime(2) + gpf(prime(2) - 1) = 3 + gpf(2) = 3 + 2 = 5.

Cf. A006530, A023503, A274022.

cminuspm2(n) = \\ prime + maxprime of prime-1
{ forprime(x=5,n, forstep(p=x,2,-1, if(isprime(p) & (x-1)%p==0,print1(x+p,","); break); ) ) }

a(n) = my(p=prime(n)); p+vecmax(factor(p-1)[,1]); \\ Michel Marcus, May 07 2024

a(n) = p + A006530(p-1) where p = prime(n).

Offset 2 and a(2) from Michel Marcus, May 07 2024

Edited by Jon E. Schoenfield, May 07 2024

A274023 Primes of the form 2^(2^k) + 13.

Original entry on oeis.org

17, 29, 269, 18446744073709551629

Offset: 1

Vincenzo Librandi, Jun 07 2016

nonn

Terms given correspond to k = 1, 2, 3 and 6.

Next term >= 2^2^39 + 13. - Charles R Greathouse IV, Jun 08 2016

Cf. A019434, A104067, A130730, A274022.

Cf. similar sequences listed in A273547.

[a: n in [0..10] | IsPrime(a) where a is 2^(2^n)+13];

Select[Table[2^(2^n) + 13, {n, 0, 15}], PrimeQ]

for(n=1,6, if(ispseudoprime(t=2^2^n+13), print1(t", "))) \\ Charles R Greathouse IV, Jun 08 2016

cp's OEIS Frontend

A085382 Sum of p = prime(n) and largest prime divisor of p-1.

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

PARI

Formula

Extensions

A274023 Primes of the form 2^(2^k) + 13.

Views

Author

Keywords

Comments

Crossrefs

Programs

Magma

Mathematica

PARI