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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069465 Number of prime factors of prime(n)^n+1, with multiplicity. 2
1, 2, 4, 2, 4, 4, 4, 3, 11, 4, 7, 4, 6, 8, 10, 3, 5, 9, 5, 7, 106, 8, 7, 7, 5, 12, 5, 8, 12, 13, 5, 12, 8, 13, 10, 6, 6, 13, 8, 11, 9, 9, 7, 19 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n) = A001222(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)=4 and A069464(10)=4.

CROSSREFS

Cf. A069462, A069464.

Sequence in context: A184186 A004020 A143235 * A047947 A018838 A116982

Adjacent sequences:  A069462 A069463 A069464 * A069466 A069467 A069468

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 16 04:47 EST 2012. Contains 205860 sequences.