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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113901 Product of omega(n) and bigomega(n) = A001221(n)*A001222(n). 1
0, 1, 1, 2, 1, 4, 1, 3, 2, 4, 1, 6, 1, 4, 4, 4, 1, 6, 1, 6, 4, 4, 1, 8, 2, 4, 3, 6, 1, 9, 1, 5, 4, 4, 4, 8, 1, 4, 4, 8, 1, 9, 1, 6, 6, 4, 1, 10, 2, 6, 4, 6, 1, 8, 4, 8, 4, 4, 1, 12, 1, 4, 6, 6, 4, 9, 1, 6, 4, 9, 1, 10, 1, 4, 6, 6, 4, 9, 1, 10, 4, 4, 1, 12, 4, 4, 4, 8, 1, 12, 4, 6, 4, 4, 4, 12, 1, 6, 6, 8, 1, 9 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

a(n) = 1 iff n is prime.

aA068993(a(n)) = 4. [Reinhard Zumkeller, Mar 13 2011]

FORMULA

omega(x): number of distinct prime divisors of x. bigomega(x): number of prime divisors of x, counted with multiplicity.

PROG

(PARI) omegaxbigomega(n) = { local(x); for(x=1, n, print1(omega(x)*bigomega(x)", ") ) }

CROSSREFS

Sequence in context: A127461 A101261 A067614 * A062799 A063647 A077808

Adjacent sequences:  A113898 A113899 A113900 * A113902 A113903 A113904

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Jan 29 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 16 09:00 EST 2012. Contains 205904 sequences.