OFFSET
1,1
COMMENTS
The sequence of n such that tau(n)<tau(n+1) seems also asymptotic to d*n. - Benoit Cloitre, Sep 07 2002
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
P. Erdős, On a problem of Chowla and some related problems, Proc. Cambridge Philos. Soc. 32 (1936), pp. 530-540.
FORMULA
a(n) seems to be asymptotic to d*n with d=2.2... - Benoit Cloitre, Sep 07 2002
In fact, Erdős proved that a(n) ~ 2n. - Charles R Greathouse IV, Dec 05 2012
MATHEMATICA
Select[Range@ 152, DivisorSigma[0, #] > DivisorSigma[0, # + 1] &] (* Michael De Vlieger, Jul 03 2015 *)
Position[Partition[DivisorSigma[0, Range[200]], 2, 1], _?(#[[1]]>#[[2]]&), {1}, Heads->False]//Flatten (* Harvey P. Dale, Jan 17 2017 *)
PROG
(PARI) is(n)=numdiv(n) > numdiv(n+1) \\ Charles R Greathouse IV, Dec 05 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
Donald S. McDonald, Sep 04 2002
EXTENSIONS
Corrected and extended by Robert G. Wilson v, Sep 06 2002
STATUS
approved