login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286266 Number of totient abundant numbers <= 10^n. 0
2, 36, 383, 3708, 35731, 347505, 3407290, 33579303, 332026623, 3290205509 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Totient abundant numbers are defined in A286265.
a(3)-a(8) were calculated by Loomis & Luca (2008).
LINKS
Paul Loomis and Florian Luca, On totient abundant numbers, Electronic Journal of Combinatorial Number Theory, Vol. 8, #A06 (2008).
EXAMPLE
There are 2 totient abundant numbers <= 10^1 (5 and 7), thus a(1)=2.
MATHEMATICA
Accumulate@ Table[Count[Select[Range[10^(n - 1) + 1, 10^n], (Total@ FixedPointList[EulerPhi, #] - (# + 1)) > # &], k_ /; k <= 10^n], {n, 6}] (* Michael De Vlieger, May 06 2017, after Alonso del Arte at A092693 *)
PROG
(PARI) s(n) = {n=eulerphi(n); if(n==1, 1, n+s(n)); }
lista(nmax) = {my(c = 0, r = 10); for(k = 1, 10^nmax, if(s(k) > k, c++); if(k == r, print1(c, ", "); r *= 10)); } \\ Amiram Eldar, Mar 26 2023
CROSSREFS
Sequence in context: A119582 A157055 A057407 * A193127 A092852 A139738
KEYWORD
nonn,more
AUTHOR
Amiram Eldar, May 05 2017
EXTENSIONS
a(9)-a(10) from Amiram Eldar, Mar 26 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)