id:A123066 - OEIS Search Results

Search: id:A123066

Displaying 1-1 of 1 results found.

page 1

(Number of numbers <= n with an odd number of distinct prime factors) - (number of numbers <= n with an even number of distinct prime factors).

+0
1

0, 1, 2, 3, 4, 3, 4, 5, 6, 5, 6, 5, 6, 5, 4, 5, 6, 5, 6, 5, 4, 3, 4, 3, 4, 3, 4, 3, 4, 5, 6, 7, 6, 5, 4, 3, 4, 3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 1, 2, 1, 0, -1, 0, -1, -2, -3, -4, -5, -4, -3, -2, -3, -4, -3, -4, -3, -2, -3, -4, -3, -2, -3, -2, -3, -4, -5, -6, -5, -4, -5, -4, -5, -4, -3, -4, -5, -6, -7, -6, -5, -6, -7, -8, -9, -10 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Analog of A072203 for number of distinct factors. Conjecture that sequence changes sign infinitely often, although the next sign change is probably large.`
	CROSSREFS	`Cf. A072203, A001221.` `Sequence in context: A114524 A058033 A125619 this_sequence A081748 A030323 A065651` `Adjacent sequences: A123063 A123064 A123065 this_sequence A123067 A123068 A123069`
	KEYWORD	`easy,sign`
	AUTHOR	`Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Sep 26 2006`

page 1

Search completed in 0.002 seconds

Last modified September 7 15:23 EDT 2008. Contains 143483 sequences.

AT&T Labs Research