id:A069464 - OEIS Search Results

Search: id:A069464

Displaying 1-1 of 1 results found.

page 1

Number of distinct prime factors of prime(n)^n+1.

+0
3

1, 2, 3, 2, 3, 4, 3, 3, 6, 4, 3, 4, 6, 7, 6, 3, 4, 9, 4, 7, 9, 6, 7, 7, 7, 5, 10, 5, 8, 11, 7, 5, 11, 8, 11, 10, 6, 6, 10, 8, 9, 9, 4, 7, 16 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = A001221(A062006(n)).`
	LINKS	`Dario Alpern, Factorization using the Elliptic Curve Method.`
	EXAMPLE	`A000040(10)^10+1=29^10+1=420707233300202=24211061*470925821,` `therefore a(10)=4 and A069465(10)=4.`
	CROSSREFS	`Cf. A069461, A069465.` `Sequence in context: A088748 A086374 A123182 this_sequence A100795 A045781 A045670` `Adjacent sequences: A069461 A069462 A069463 this_sequence A069465 A069466 A069467`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Mar 24 2002`
	EXTENSIONS	`More terms from Hugo Pfoertner (hugo(AT)pfoertner.org), May 21 2004`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research