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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016025 Least k such that (tau(k^k)+k-1)/k=n. 3

%I

%S 1,2,4,8,16,32,64,128,6,512,1024,2048,10,8192,16384,32768,14,15,

%T 262144,524288,1048576,2097152,4194304,21,22,33554432,67108864,12,26,

%U 536870912,1073741824,2147483648,4294967296,8589934592,17179869184,33,34,35

%N Least k such that (tau(k^k)+k-1)/k=n.

%C a(n) <= 2^(n-1); if a lesser solution k exists, then it must have more than one distinct prime factor and k < n. - Chandler

%K nonn

%O 1,2

%A _Robert G. Wilson v_

%E More terms from _Robert G. Wilson v_, Aug 06 2005

%E Definition corrected by Vladeta Jovovic, Sep 03 2005

%E a(30)-a(38) from _Ray Chandler_, Dec 05 2008

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 December 2 14:48 EST 2021. Contains 349445 sequences. (Running on oeis4.)