id:A077480 - OEIS Search Results

Search: id:A077480

Displaying 1-1 of 1 results found.

page 1

Total number of prime factors of numbers m with BigOmega(m) == 0 modulo omega(m) (counted with repetition).

+0
3

1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 1, 2, 2, 4, 1, 1, 2, 2, 1, 4, 2, 2, 3, 1, 3, 1, 5, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 2, 1, 2, 2, 1, 4, 2, 4, 2, 2, 1, 1, 2, 6, 2, 3, 1, 2, 3, 1, 1, 2, 2, 3, 1, 4, 2, 1, 2, 2, 2, 4, 1, 2, 2, 2, 2, 6, 1, 4, 1, 3, 1, 4, 3, 2, 1, 1, 3, 2, 1, 3, 2, 2, 2, 2, 2, 2, 3, 1, 7, 2, 3, 1, 2, 2, 4 (list; graph; listen)

	OFFSET	`1,3`
	CROSSREFS	`Equals A001222(A067340(n)).` `Cf. A077479, A077481, A001221.` `Sequence in context: A128118 A107456 A165112 this_sequence A059829 A076558 A057217` `Adjacent sequences: A077477 A077478 A077479 this_sequence A077481 A077482 A077483`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 06 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research