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.

A338381 Smallest number m such that tau(k) * k = m has exactly n solutions when tau(k) is the number of divisors of k.

Table of values

n a(n)
1 1
2 108
3 2688
4 21000000
5 8400000

List of values

[1, 108, 2688, 21000000, 8400000]