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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070821 Integer part of n/(spf(n)*gpf(n)), where spf=A020639 is the smallest prime factor and gpf=A006530 the greatest prime factor. 0
1, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 2, 0, 1, 1, 4, 0, 3, 0, 2, 1, 1, 0, 4, 1, 1, 3, 2, 0, 3, 0, 8, 1, 1, 1, 6, 0, 1, 1, 4, 0, 3, 0, 2, 3, 1, 0, 8, 1, 5, 1, 2, 0, 9, 1, 4, 1, 1, 0, 6, 0, 1, 3, 16, 1, 3, 0, 2, 1, 5, 0, 12, 0, 1, 5, 2, 1, 3, 0, 8, 9, 1, 0, 6, 1, 1, 1, 4, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,8

COMMENTS

m/(spf(m)*gpf(m)) is an integer iff m is not prime;

a(m) = 0 iff m is prime (A000040);

for m>1: a(m) = 1 iff m is semiprime (A001358).

CROSSREFS

a(n) = floor(A032742(n)/A006530(n)) = floor(A052126(n)/A020639(n)).

Sequence in context: A105469 A136167 A140748 * A165890 A051632 A122821

Adjacent sequences:  A070818 A070819 A070820 * A070822 A070823 A070824

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 15 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 04:18 EST 2012. Contains 205860 sequences.