id:A100573 - OEIS Search Results

Search: id:A100573

Displaying 1-1 of 1 results found.

page 1

Smallest difference between distinct prime divisors of n, or 0 if n is a prime power.

+0
1

0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 5, 2, 0, 0, 1, 0, 3, 4, 9, 0, 1, 0, 11, 0, 5, 0, 1, 0, 0, 8, 15, 2, 1, 0, 17, 10, 3, 0, 1, 0, 9, 2, 21, 0, 1, 0, 3, 14, 11, 0, 1, 6, 5, 16, 27, 0, 1, 0, 29, 4, 0, 8, 1, 0, 15, 20, 2, 0, 1, 0, 35, 2, 17, 4, 1, 0, 3, 0, 39, 0, 1, 12, 41, 26, 9, 0, 1, 6, 21, 28, 45 (list; graph; listen)

	OFFSET	`1,10`
	EXAMPLE	`For 30 = 235, 2 and 3 are separated by only 1, so a(30) = 1.`
	MATHEMATICA	<<NumberTheory`NumberTheoryFunctions` pfl[x_] :=PrimeFactorList[x] pd[x_] :=Delete[RotateLeft[pfl[x]]-pfl[x], -1] Table[Min[pd[w]], {w, 1, 1000}] (Labos)
	CROSSREFS	`Sequence in context: A111527 A035695 A100257 this_sequence A049087 A046665 A100574` `Adjacent sequences: A100570 A100571 A100572 this_sequence A100574 A100575 A100576`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Jan 02 2005`
	EXTENSIONS	`More terms from Labos E. (labos(AT)ana.sote.hu), Jan 05 2005`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research