|
%I #19 Apr 30 2021 06:02:21
%S 1,2,3,4,5,6,7,8,9,11,13,14,16,17,19,21,23,25,27,28,29,31,32,37,41,43,
%T 47,49,53,59,61,62,64,67,71,73,79,81,83,89,97,101,103,107,109,113,121,
%U 124,125,127,128,131,137,139,149,151,157,163,167,169,173,179,181,191,193,197,199,211,223,227,229,233,237
%N Numbers n for which A000010(n) = A285699(n); positions of zeros in A285709.
%C After a(1) = 1, also numbers n such that A051953(n) = A079277(n).
%H Antti Karttunen, <a href="/A285710/b285710.txt">Table of n, a(n) for n = 1..6672</a>
%t Flatten@ Position[#, 0] &@ Table[EulerPhi@ n - (n - If[n <= 2, n - 1, Module[{k = n - 2, e = Floor@ Log2@ n}, While[PowerMod[n, e, k] != 0, k--]; k]]), {n, 240}] (* _Michael De Vlieger_, Apr 26 2017 *)
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A285710 (ZERO-POS 1 1 A285709))
%o (Python)
%o from sympy import divisors, totient
%o from sympy.ntheory.factor_ import core
%o def a007947(n): return max(i for i in divisors(n) if core(i) == i)
%o def a079277(n):
%o k=n - 1
%o while True:
%o if a007947(k*n) == a007947(n): return k
%o else: k-=1
%o def a285699(n): return 1 if n<2 else n - a079277(n)
%o print([n for n in range(1, 301) if totient(n) == a285699(n)]) # _Indranil Ghosh_, Apr 26 2017
%Y Positions of zeros in A285709.
%Y Cf. A000010, A051953, A079277, A208815, A285699.
%Y Cf. A000961 (a subsequence).
%K nonn
%O 1,2
%A _Antti Karttunen_, Apr 26 2017
|
