Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063069
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A063069
%S A063069 45,104,345,3255,17534,22935,70634,983775,1025504,1156701,2200694,
%T A063069 2619705,2745765,4163355,4447064,4695704,6372794,9718904,11903775,
%U A063069 23992215,26879684,29357475,37239735,40588485,41207144,42694197
%N A063069 phi(n)-d(n) = phi(n+1)-d(n+1) where d(n) is the number of divisors function.
%H A063069 Harry J. Smith, <a href="b063069.txt">Table of n, a(n) for n=1,...,33</
               a>
%o A063069 (PARI) for(n=1,10^5, if(eulerphi(n)-numdiv(n)==eulerphi(n+1)-numdiv(n+1),
               print(n)))
%o A063069 (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]
%Y A063069 Cf. A000005, A000010.
%Y A063069 Sequence in context: A044564 A118090 A124974 this_sequence A067828 A144552 
               A068355
%Y A063069 Adjacent sequences: A063066 A063067 A063068 this_sequence A063070 A063071 
               A063072
%K A063069 hard,nonn
%O A063069 1,1
%A A063069 Jason Earls (zevi_35711(AT)yahoo.com), Aug 04 2001
%E A063069 More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Nov 04 2001
%E A063069 More terms from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 16 2009

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research