id:A102299 - OEIS Search Results

Search: id:A102299

Displaying 1-1 of 1 results found.

page 1

Number of prime divisors with multiplicity of n where n and n+1 are composite or twin composite numbers.

+0
1

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

	OFFSET	`1,1`
	EXAMPLE	`For n=8 n+1=9 a twin composite pair. 8=222 or product of 3 prime divisors` `with multiplicity.`
	PROGRAM	`(PARI) f1(n) = for(x=1, n, y=composite(x); if(!isprime(y+1), print1(bigomega(y)", "))) composite(n) =\The n-th composite number. 1 is def as not prime nor composite. { local(c, x); c=1; x=1; while(c <= n, x++; if(!isprime(x), c++); ); return(x) }`
	CROSSREFS	`Sequence in context: A127599 A085034 A119323 this_sequence A141070 A163751 A067279` `Adjacent sequences: A102296 A102297 A102298 this_sequence A102300 A102301 A102302`
	KEYWORD	`easy,nonn`
	AUTHOR	`Cino Hilliard (hillcino368(AT)gmail.com), Feb 19 2005`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research