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.

A356136 a(n) is the smallest number k > 1 such that, in the interval 1..k, there are as many integers that have exactly 2n divisors as there are primes (or -1 if no such number exists).

Table of values

n a(n)
1 2
2 27
3 -1
4 665
5 -1
6 57675
7 -1
8 57230
9 -1

List of values

[2, 27, -1, 665, -1, 57675, -1, 57230, -1]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.