cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A016025 #9 Mar 30 2012 17:30:18
%S A016025 1,2,4,8,16,32,64,128,6,512,1024,2048,10,8192,16384,32768,14,15,
%T A016025 262144,524288,1048576,2097152,4194304,21,22,33554432,67108864,12,26,
%U A016025 536870912,1073741824,2147483648,4294967296,8589934592,17179869184,33,34,35
%N A016025 Least k such that (tau(k^k)+k-1)/k=n.
%C A016025 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 A016025 nonn
%O A016025 1,2
%A A016025 _Robert G. Wilson v_
%E A016025 More terms from _Robert G. Wilson v_, Aug 06 2005
%E A016025 Definition corrected by Vladeta Jovovic, Sep 03 2005
%E A016025 a(30)-a(38) from _Ray Chandler_, Dec 05 2008