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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069461 Number of distinct prime factors of prime(n)^n-1. 3
0, 1, 2, 3, 3, 5, 2, 6, 6, 8, 7, 11, 5, 7, 9, 8, 5, 12, 4, 13, 8, 10, 4, 16, 7, 12, 12, 13, 6, 18, 4, 15, 10, 8, 10, 19, 8, 9, 8, 17, 5, 21, 5, 13, 16, 16, 6, 21, 9, 12, 9, 15 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

a(n) = A001221(A069459(n)).

LINKS

Dario Alpern, Factorization using the Elliptic Curve Method.

EXAMPLE

A000040(8)^8-1=19^8-1=16983563040=2^5*3^2*5*17*181*3833, therefore a(8)=6 and A069462(8)=11.

A000040(9)^9-1=23^9-1=1801152661462=2*7*11*19*79*7792003, therefore a(9)=6 and A069462(9)=6.

PROG

(PARI) for(n=1, 52, print1(omega(prime(n)^n-1)", ")) - Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 03 2008

CROSSREFS

Cf. A069464, A069462.

Sequence in context: A049272 A181483 A205130 * A063256 A131320 A119912

Adjacent sequences:  A069458 A069459 A069460 * A069462 A069463 A069464

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

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 03 2008

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 17 05:53 EST 2012. Contains 205985 sequences.