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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066922 GCD(OMEGA(n),omega(n)). 1
0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 1, 2, 1, 2, 2, 2, 2, 1, 1, 1, 2, 1, 3, 1, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROG

(PARI) { for (n=1, 1000, write("b066922.txt", n, " ", gcd(bigomega(n), omega(n))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Apr 07 2010]

CROSSREFS

Sequence in context: A086257 A161098 A136177 * A033183 A090677 A161097

Adjacent sequences:  A066919 A066920 A066921 * A066923 A066924 A066925

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 23 2002

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 02:51 EST 2012. Contains 205860 sequences.