id:A113901 - OEIS Search Results

Search: id:A113901

Displaying 1-1 of 1 results found.

page 1

Product of omega(n) and bigomega(n).

+0
1

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

	OFFSET	`1,4`
	COMMENT	`if a(n) = 1 then n is prime.`
	FORMULA	`omega(x): number of distinct prime divisors of x. bigomega(x): number of prime divisors of x, counted with multiplicity.`
	PROGRAM	`(PARI) omegaxbigomega(n) = { local(x); for(x=1, n, print1(omega(x)*bigomega(x)", ") ) }`
	CROSSREFS	`Sequence in context: A127461 A101261 A067614 this_sequence A062799 A063647 A077808` `Adjacent sequences: A113898 A113899 A113900 this_sequence A113902 A113903 A113904`
	KEYWORD	`easy,nonn`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Jan 29 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research