Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,7

FORMULA

It seems that if n > 1 then sum(k=1, n, a(kn)) > n*Log(Log(n)).

PROGRAM

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

CROSSREFS

Sequence in context: A126460 A100940 A063421 this_sequence A003637 A110628 A107292

Adjacent sequences: A073064 A073065 A073066 this_sequence A073068 A073069 A073070

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 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research