|
Search: id:A080368
|
|
|
| A080368 |
|
Least unitary prime divisor of n or a(n)=0 if no such prime-divisor exists. |
|
+0
1
|
|
| 2, 3, 0, 5, 2, 7, 0, 0, 2, 11, 3, 13, 2, 3, 0, 17, 2, 19, 5, 3, 2, 23, 3, 0, 2, 0, 7, 29, 2, 31, 0, 3, 2, 5, 0, 37, 2, 3, 5, 41, 2, 43, 11, 5, 2, 47, 3, 0, 2, 3, 13, 53, 2, 5, 7, 3, 2, 59, 3, 61, 2, 7, 0, 5, 2, 67, 17, 3, 2, 71, 0, 73, 2, 3, 19, 7, 2, 79, 5, 0, 2, 83, 3, 5, 2, 3, 11, 89, 2, 7, 23, 3, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
n=252100=2.2.3.5.5.7.11.11, unitary prime divisors={3,7}; smallest is 3, so a(252100)=3
|
|
MATHEMATICA
|
ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] gb[x_] := GCD[ba[x], x/ba[x]] fpg[x_] := Flatten[Position[gb[x], 1]] upd[x_] := Part[ba[x], fpg[x]] mxu[x_] := Max[upd[x]] miu[x_] := Min[upd[x]] Do[If[Equal[upd[n], {}], Print[0]]; If[ !Equal[upd[n], {}], Print[miu[n]]], {n, 2, 256}]
|
|
CROSSREFS
|
Cf. A034444, A056169, A080367.
Sequence in context: A071322 A072594 A074722 this_sequence A057174 A080367 A066913
Adjacent sequences: A080365 A080366 A080367 this_sequence A080369 A080370 A080371
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E (labos(AT)ana.sote.hu), Feb 21 2003
|
|
|
Search completed in 0.002 seconds
|
