A074756 Least s > n such that tau(n!) divides tau(s!).

2, 3, 4, 5, 8, 7, 11, 14, 21, 11, 20, 13, 26, 30, 26, 17, 27, 19, 54, 40, 60, 23, 42, 48, 48, 45, 44, 29, 108, 31, 54, 53, 66, 58, 90, 37, 55, 90, 75, 41, 77, 43, 59, 58, 126, 47, 130, 559, 559, 144, 77, 53, 123, 105, 105, 90, 74, 59, 119, 61, 119, 176, 344, 126, 126, 67

Offset

1,1

Links

Harvey P. Dale, Table of n, a(n) for n = 1..200

Mathematica

ls[n_]:=Module[{s=n+1, nt=DivisorSigma[0, n!]}, While[!Divisible[ DivisorSigma[0, s!], nt], s++]; s]; Array[ls, 70] (* Harvey P. Dale, Sep 18 2013 *)

Prog

(PARI) a(n)=if(n<0, 0, s=n+1; while(numdiv(s!)%numdiv(n!)>0, s++); s)

Crossrefs

Sequence in context: A330573 A309369 A091893 * A240221 A075162 A056240

Adjacent sequences: A074753 A074754 A074755 * A074757 A074758 A074759

Keyword

easy,nonn

Author

Benoit Cloitre, Sep 28 2002

Status

approved