id:A082863 - OEIS Search Results

Search: id:A082863

Displaying 1-1 of 1 results found.

page 1

Number of distinct prime factors of n^2-1.

+0
1

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

	OFFSET	`2,3`
	COMMENT	`This is a very slowly growing sequence - by n=100000 the maximum value is 8. Find an asymptotic formula. Find the record holders for this sequence.`
	FORMULA	`omega((n-1)*(n+1))`
	EXAMPLE	`a(11)=3 because (11-1)(11+1)=10.12=2^3.3.5, which has 3 distinct prime factors, namely 2,3 and 5.`
	PROGRAM	`(PARI) for (n=2, 100, print1(omega((n-1)*(n+1))", "))`
	CROSSREFS	`Sequence in context: A147793 A052298 A081412 this_sequence A029411 A165093 A066088` `Adjacent sequences: A082860 A082861 A082862 this_sequence A082864 A082865 A082866`
	KEYWORD	`nonn`
	AUTHOR	`Jon Perry (perry(AT)globalnet.co.uk), May 24 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research