id:A049236 - OEIS Search Results

Search: id:A049236

Displaying 1-1 of 1 results found.

page 1

Number of distinct prime factors of prime(n)+2.

+0
2

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

	OFFSET	`1,6`
	FORMULA	`Length[ FactorInteger[ Prime[ n ]+2 ] ]`
	EXAMPLE	`p(27)=103, p+2=105=3.5.7 has 3 prime-factors,a(27)=3`
	CROSSREFS	`Cf. A000040, A001221, A001359, A064911, A064909-A064911.` `Sequence in context: A026517 A072047 A106802 this_sequence A094840 A035218 A139355` `Adjacent sequences: A049233 A049234 A049235 this_sequence A049237 A049238 A049239`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research