Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069460
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069460 Greatest prime factor of prime(n)^n-1. +0
3
1, 2, 31, 5, 3221, 157, 25646167, 3833, 7792003, 732541, 150332843, 144061, 17615988547, 6177695707, 461017351, 31129845205681, 361353204962363828785531, 903870199, 751410597400064602523400427092397, 25058741, 153436090543, 1750258119644519 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = A006530(A069459(n)).

LINKS

Dario Alpern, Factorization using the Elliptic Curve Method.

EXAMPLE

A000040(9)^9-1=23^9-1=1801152661462=2*7*11*19*79*7792003,

therefore a(9)=7792003.

CROSSREFS

Cf. A069463.

Sequence in context: A113511 A062008 A091776 this_sequence A117816 A099189 A053234

Adjacent sequences: A069457 A069458 A069459 this_sequence A069461 A069462 A069463

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research