The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087273 Largest prime factor of 3*prime(n) + 1. 6
7, 5, 2, 11, 17, 5, 13, 29, 7, 11, 47, 7, 31, 13, 71, 5, 89, 23, 101, 107, 11, 17, 5, 67, 73, 19, 31, 23, 41, 17, 191, 197, 103, 19, 7, 227, 59, 7, 251, 13, 269, 17, 41, 29, 37, 23, 317, 67, 31, 43, 7, 359, 181, 29, 193, 79, 101, 37, 13, 211, 17, 11, 461, 467, 47, 17, 71, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) >= 5 except for n = 3. - Robert Israel, Sep 19 2016
LINKS
FORMULA
a(n) = A006530(1 + 3*A000040(n)).
EXAMPLE
n=100: p(100)=541, m = 3*541 + 1 = 1624 = 2*2*2*7*29 so a(100)=29.
MAPLE
seq(max(numtheory:-factorset(3*ithprime(i)+1)), i=1..100); # Robert Israel, Sep 19 2016
MATHEMATICA
ffi[x_] := Flatten[FactorInteger[x]] ma[x_] := Part[Reverse[ffi[x]], 2] Table[ma[3*Prime[w]+1], {w, 1, 100}]
Table[FactorInteger[3Prime[n]+1][[-1, 1]], {n, 70}] (* Harvey P. Dale, Apr 10 2012 *)
PROG
(PARI) a(n) = vecmax(factor(3*prime(n)+1)[, 1]); \\ Michel Marcus, Sep 19 2016
(Magma) [#f eq 0 select 1 else f[#f][1] where f is Factorization(3*NthPrime(n)+1): n in [1..90]]; // Vincenzo Librandi, Sep 20 2016
CROSSREFS
Cf. A006530.
Sequence in context: A021097 A307160 A369106 * A297879 A245510 A199794
KEYWORD
nonn
AUTHOR
Labos Elemer, Sep 18 2003
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 00:43 EDT 2024. Contains 373140 sequences. (Running on oeis4.)