id:A082067 - OEIS Search Results

Search: id:A082067

Displaying 1-1 of 1 results found.

page 1

A082067

Least common prime-divisor of n and Phi[n]=A000010(n); a(n)=1 if no common prime-divisor was found.

+0
1

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

	OFFSET	`1,4`
	MATHEMATICA	`ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] f1[x_] := n; f2[x_] := EulerPhi[x] Table[Min[Intersection[ba[f1[w]], ba[f2[w]]]], {w, 1, 128}]`
	CROSSREFS	`Cf. A000010, A082061-A082072.` `Adjacent sequences: A082064 A082065 A082066 this_sequence A082068 A082069 A082070` `Sequence in context: A102632 A094076 A089611 this_sequence A082061 A107286 A087039`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 07 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research