login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065394 Increasing values of A065395: a(n) = A065395[A065393(n)] = A000203[A000010[A065393(n)]] - A000010[A000203[A065393(n)]]. 5
1, 5, 8, 14, 22, 25, 31, 48, 56, 73, 78, 80, 138, 159, 163, 210, 240, 248, 312, 314, 474, 482, 634, 648, 684, 723, 836, 896, 978, 1026, 1134, 1184, 1320, 1344, 1410, 1424, 1608, 1686, 1760, 1776, 1862, 2226, 2624, 2824, 2936, 3024, 3120, 3280, 3460, 3660 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,500

MATHEMATICA

a=0; s=0; Do[s=DivisorSigma[1, EulerPhi[n]]-EulerPhi[DivisorSigma[1, n]]; If[s>a, a=s; Print[s]], {n, 1, 10000}]; Output is s.

PROG

(PARI) { n=r=0; for (m=1, 10^9, x=sigma(eulerphi(m)) - eulerphi(sigma(m)); if (x > r, r=x; write("b065394.txt", n++, " ", x); if (n==500, return)) ) } [From Harry J. Smith, Oct 18 2009]

CROSSREFS

Cf. A000010, A000203, A065393, A065395.

Sequence in context: A049693 A084139 A092590 * A124011 A101835 A192522

Adjacent sequences:  A065391 A065392 A065393 * A065395 A065396 A065397

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 05 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 19 12:08 EDT 2013. Contains 226404 sequences.