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.

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 128, 6, 512, 1024, 2048, 10, 8192, 16384, 32768, 14, 15, 262144, 524288, 1048576, 2097152, 4194304, 21, 22, 33554432, 67108864, 12, 26, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 33, 34, 35
Offset: 1

Views

Author

Keywords

Comments

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

Extensions

More terms from Robert G. Wilson v, Aug 06 2005
Definition corrected by Vladeta Jovovic, Sep 03 2005
a(30)-a(38) from Ray Chandler, Dec 05 2008