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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105560 a(n) = A000040(A001222(n)). 0
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; refs; listen; history; internal format)
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

PROG

(PARI) d(n) = for(x=2, n, print1(prime(bigomega(x))", "))

CROSSREFS

Sequence in context: A054714 A060324 A046216 * A165916 A096013 A072380

Adjacent sequences:  A105557 A105558 A105559 * A105561 A105562 A105563

KEYWORD

easy,nonn,less

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), May 03 2005

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 14 20:13 EST 2012. Contains 205663 sequences.