The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286265 Totient abundant numbers: numbers n such that A092693(n) > n. 7
 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 33, 35, 37, 41, 43, 47, 49, 51, 53, 55, 59, 61, 65, 67, 69, 71, 73, 77, 79, 83, 85, 87, 89, 91, 95, 97, 101, 103, 107, 109, 113, 115, 119, 121, 123, 125, 127, 131, 133, 137, 139, 141, 143, 145, 149, 151, 153, 155, 157 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 Paul Loomis and Florian Luca, On totient abundant numbers, Electronic Journal of Combinatorial Number Theory, Vol. 8, #A06 (2008). EXAMPLE 19 is a totient abundant number since A092693(19) = phi(19) + phi(phi(19)) + ... = 18 + 6 + 2 + 1 = 27 > 19. MATHEMATICA totAbundantQ[n_] := Plus @@ FixedPointList[ EulerPhi@ # &, n] > 2*n+1; Select[Range[1000], totAbundantQ] PROG (Python) from sympy import totient def a092693(n): return 0 if n==1 else totient(n) + a092693(totient(n)) print [n for n in range(1, 201) if a092693(n) > n] # Indranil Ghosh, May 05 2017 CROSSREFS Cf. A000010, A082897, A092693. Sequence in context: A136801 A106571 A067291 * A007310 A069040 A070191 Adjacent sequences:  A286262 A286263 A286264 * A286266 A286267 A286268 KEYWORD nonn AUTHOR Amiram Eldar, May 05 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 3 04:30 EDT 2020. Contains 336197 sequences. (Running on oeis4.)