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.

A171959 a(1) = 0, for n >= 2; a(n) = the smallest number h such that tau(h) = A000005(h) = a(n-1) + 3.

Original entry on oeis.org

0, 4, 64, 73786976294838206464
Offset: 1

Views

Author

Jaroslav Krizek, Nov 06 2010

Keywords

Comments

a(5) = 2^44210291368986342 * 3^1668 is too large to include.

Crossrefs

Formula

A000005(a(n)) = a(n-1) + 3 for n >= 2.
For n>1, a(n) = A005179(a(n-1) + 3).