id:A077479 - OEIS Search Results

Search: id:A077479

Displaying 1-1 of 1 results found.

page 1

Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).

+0
3

1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 1, 2, 2, 3, 1, 1, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 3, 1, 2, 3, 2, 1, 1, 3, 2, 1, 3, 2, 2, 2, 1, 2, 2, 1, 1, 1, 2, 3, 1, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,5`
	CROSSREFS	`Equals A001221(A067340(n)).` `Cf. A077480, A077481, A001222.` `Adjacent sequences: A077476 A077477 A077478 this_sequence A077480 A077481 A077482` `Sequence in context: A046072 A072273 A034380 this_sequence A070106 A109706 A029444`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 06 2002`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research