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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125029 a(n) = number of exponents in the prime-factorization of n which are noncomposite. 1
0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 0, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 2, 2, 0, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 2, 3, 1, 1, 0, 2, 1, 3, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

EXAMPLE

a(720) = 2, since the prime-factorization of 720 is 2^4 *3^2 *5^1 and 2 of the exponents in this factorization are non-composites (the exponents 2 and 1).

MATHEMATICA

f[n_] := Length @ Select[Last /@ FactorInteger[n], # == 1 || PrimeQ[ # ] &]; Table[f[n], {n, 110}] (*Chandler*)

CROSSREFS

Cf. A125030.

Sequence in context: A126864 A124766 A103765 * A062893 A158210 A087802

Adjacent sequences:  A125026 A125027 A125028 * A125030 A125031 A125032

KEYWORD

nonn

AUTHOR

Leroy Quet, Nov 16 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 19 2006

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 23:53 EST 2012. Contains 205689 sequences.