OFFSET
0,1
COMMENTS
Previous name was: t(n) = z(n) where t(n)= |eulerphi(n)-n| and z(n)= t(t(n)-n).
LINKS
Amiram Eldar, Table of n, a(n) for n = 0..6637
Ralf Stephan, Prove or disprove: 100 conjectures from the OEIS, arXiv:math/0409509 [math.CO], 2004.
Lawrence Sze, Conjecture 36 (at archive.org).
Lawrence Sze, Conjecture 36 - from OEIS - a.k.a. A063920, preprint, 2004. [cached copy]
Index entries for linear recurrences with constant coefficients, signature (0,2).
FORMULA
G.f.: (10 + 14x)/(1 - 2x^2).
a(n) = (12-2*(-1)^n) * 2^floor(n/2). - Ralf Stephan, Jul 19 2013
Sum_{n>=0} 1/a(n) = 12/35. - Amiram Eldar, Mar 28 2022
MATHEMATICA
CoefficientList[Series[(10 + 14 x) / (1 - 2 x^2), {x, 0, 40}], x] (* Vincenzo Librandi, Feb 29 2016 *)
PROG
(PARI) t(n) = abs(eulerphi(n)-n); z(n) = t(t(n)-n);
for(n=1, 113, if(t(n)==z(n), print1(n, ", ")))
(Magma) [(12-2*(-1)^n)*2^Floor(n/2): n in [0..50]]; // Vincenzo Librandi, Feb 29 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jason Earls, Aug 31 2001
EXTENSIONS
Better name from Ivan Neretin, Feb 28 2016
STATUS
approved