login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072865 Smallest k > 1 dividing tau(k*n) (cf. A000005). 1
2, 4, 2, 2, 2, 2, 2, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Sequence contains the values 2,3,4,5,6,7,8,9,10,11,12. The smallest x such that a(x)=12 is x = 32768 = 2^15.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

PROG

(PARI) A072865(n) = for(k=2, oo, if(!(numdiv(k*n)%k), return(k))); \\ Antti Karttunen, Sep 27 2018

CROSSREFS

Cf. A000005.

Sequence in context: A194564 A284690 A064132 * A322728 A179686 A286479

Adjacent sequences:  A072862 A072863 A072864 * A072866 A072867 A072868

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, Jul 27 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 01:51 EDT 2020. Contains 335600 sequences. (Running on oeis4.)