id:A105560 - OEIS Search Results

Search: id:A105560

Displaying 1-1 of 1 results found.

page 1

a(n) = A000040(A001222(n)).

+0
1

2, 2, 3, 2, 3, 2, 5, 3, 3, 2, 5, 2, 3, 3, 7, 2, 5, 2, 5, 3, 3, 2, 7, 3, 3, 5, 5, 2, 5, 2, 11, 3, 3, 3, 7, 2, 3, 3, 7, 2, 5, 2, 5, 5, 3, 2, 11, 3, 5, 3, 5, 2, 7, 3, 7, 3, 3, 2, 7, 2, 3, 5, 13, 3, 5, 2, 5, 3, 5, 2, 11, 2, 3, 5, 5, 3, 5, 2, 11, 7, 3, 2, 7, 3, 3, 3, 7, 2, 7, 3, 5, 3, 3, 3, 13, 2, 5, 5, 7 (list; graph; listen)

	OFFSET	`2,1`
	MATHEMATICA	`Table[Prime[Sum[FactorInteger[n][[i, 2]], {i, 1, Length[FactorInteger[n]]}]], {n, 2, 40}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 16 2007`
	PROGRAM	`(PARI) d(n) = for(x=2, n, print1(prime(bigomega(x))", "))`
	CROSSREFS	`Sequence in context: A054714 A060324 A046216 this_sequence A165916 A096013 A072380` `Adjacent sequences: A105557 A105558 A105559 this_sequence A105561 A105562 A105563`
	KEYWORD	`easy,nonn,less`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), May 03 2005`

page 1

Search completed in 0.002 seconds

Last modified December 5 20:25 EST 2009. Contains 170428 sequences.

AT&T Labs Research