|
Search: id:A070813
|
|
|
| A070813 |
|
Even numbers 2m such that f[x]=Phi[P[x]]-P[Phi[x]] = 2m for some x, where P[m]=largest prime divisor of m, Phi[m]=totient[m]. |
|
+0
10
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Solutions to A070812[x]=0 are in A007283, for A070812[x]=2 are in A070004.
|
|
FORMULA
|
a(n)=Fermat-primes minus 3 = A000215(n)-3
|
|
EXAMPLE
|
x=3,5,17,257,65537, P[x]=x, P[Phi[x]]=2, Phi[P[x]]=x-1, f[x]=x-1-2=x-3; so if x is a Fermat-prime, then value of commutator equals x-3, i.e. it is an even number.
|
|
MATHEMATICA
|
pf[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] Do[s=EulerPhi[pf[n]]-pf[EulerPhi[n]]; If[ !Odd[s]&&Greater[s, 2], Print[{n, s}], {n, 3, 10000000}] Only 2, 254 and 65534 appear in printout of s. The sequence is provided by Union[{s}, {0, 2}].
|
|
CROSSREFS
|
Cf. A000010, A006530, A070812, A000215.
Sequence in context: A053846 A053855 A152476 this_sequence A156214 A015197 A156910
Adjacent sequences: A070810 A070811 A070812 this_sequence A070814 A070815 A070816
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), May 09 2002
|
|
|
Search completed in 0.002 seconds
|
