login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069463 Greatest prime factor of prime(n)^n+1. 2
3, 5, 7, 1201, 13421, 28393, 22796593, 563377, 1117, 470925821, 1048563011, 3512477579761, 644522798011, 22021301, 24317675453761, 14189041365214758401, 21199857783625129028395239857, 13842121, 292354984050175817, 613624820402521 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(n) = A006530(A062006(n)).

LINKS

Dario Alpern, Factorization using the Elliptic Curve Method.

EXAMPLE

A000040(10)^10+1=29^10+1=420707233300202=2*421*1061*470925821, therefore a(10)=470925821.

CROSSREFS

Cf. A069460.

Sequence in context: A046472 A065824 A191546 * A073691 A110336 A073695

Adjacent sequences:  A069460 A069461 A069462 * A069464 A069465 A069466

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 24 2002

EXTENSIONS

More terms from Hugo Pfoertner (hugo(AT)pfoertner.org), May 21 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 19:04 EST 2012. Contains 205535 sequences.