Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073068
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073068 Minimum value of abs(n-x*tau(x)) x>0. +0
1
0, 1, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 1, 2, 3, 4, 3, 2, 1, 0, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 3, 2, 1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 3, 2, 1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 0, 1 (list; graph; listen)
OFFSET

1,8

FORMULA

a(A036438(n))=0 . It seems that sum(k=1, n, a(k)) is asymptotic to C*n with 1.5<C<2

PROGRAM

(PARI) a(n)=vecmin(vector(n, k, abs(n-k*numdiv(k))))

CROSSREFS

Sequence in context: A095774 A071993 A118777 this_sequence A116683 A079748 A073368

Adjacent sequences: A073065 A073066 A073067 this_sequence A073069 A073070 A073071

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 17 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research