|
Search: id:A063069
|
|
|
| A063069 |
|
phi(n)-d(n) = phi(n+1)-d(n+1) where d(n) is the number of divisors function. |
|
+0
1
|
|
| 45, 104, 345, 3255, 17534, 22935, 70634, 983775, 1025504, 1156701, 2200694, 2619705, 2745765, 4163355, 4447064, 4695704, 6372794, 9718904, 11903775, 23992215, 26879684, 29357475, 37239735, 40588485, 41207144, 42694197
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,33
|
|
PROGRAM
|
(PARI) for(n=1, 10^5, if(eulerphi(n)-numdiv(n)==eulerphi(n+1)-numdiv(n+1), print(n)))
(PARI) { n=0; s=1; for (m=1, 10^9, if (s!=(r=(eulerphi(m) - numdiv(m))), s=r, write("b063069.txt", n++, " ", m - 1); if (n==100, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 16 2009]
|
|
CROSSREFS
|
Cf. A000005, A000010.
Sequence in context: A044564 A118090 A124974 this_sequence A067828 A144552 A068355
Adjacent sequences: A063066 A063067 A063068 this_sequence A063070 A063071 A063072
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Aug 04 2001
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Nov 04 2001
More terms from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 16 2009
|
|
|
Search completed in 0.002 seconds
|
