Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072927
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072927 a(n) = minimum value of abs(n-Phi(x)) x>0. +0
1
0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 3, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0 (list; graph; listen)
OFFSET

1,14

FORMULA

a(A002202(n))=0 and it seems that sum(k=1, n, a(k)) is asymptotic to C*n*log(n) with C=0.15....

CROSSREFS

Adjacent sequences: A072924 A072925 A072926 this_sequence A072928 A072929 A072930

Sequence in context: A088568 A123737 A083037 this_sequence A120086 A085004 A095774

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 11 2002

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 21 00:02 EST 2008. Contains 150810 sequences.


AT&T Labs Research