cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A085382 #19 May 11 2024 20:24:25
%S A085382 5,7,10,16,16,19,22,34,36,36,40,46,50,70,66,88,66,78,78,76,92,124,100,
%T A085382 100,106,120,160,112,120,134,144,154,162,186,156,170,166,250,216,268,
%U A085382 186,210,196,204,210,218,260,340,248,262,256,246,256,259,394,336,276,300
%N A085382 Sum of p = prime(n) and largest prime divisor of p-1.
%F A085382 a(n) = p + A006530(p-1) where p = prime(n).
%e A085382 a(2) = prime(2) + gpf(prime(2) - 1) = 3 + gpf(2) = 3 + 2 = 5.
%o A085382 (PARI) cminuspm2(n) = \\ prime + maxprime of prime-1
%o A085382 { forprime(x=5,n, forstep(p=x,2,-1, if(isprime(p) & (x-1)%p==0,print1(x+p,","); break); ) ) }
%o A085382 (PARI) a(n) = my(p=prime(n)); p+vecmax(factor(p-1)[,1]); \\ _Michel Marcus_, May 07 2024
%Y A085382 Cf. A006530, A023503, A274022.
%K A085382 easy,nonn
%O A085382 2,1
%A A085382 _Cino Hilliard_, Aug 12 2003
%E A085382 Offset 2 and a(2) from _Michel Marcus_, May 07 2024
%E A085382 Edited by _Jon E. Schoenfield_, May 07 2024