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.

A374264 a(n) is the smallest m such that A374167(m) = n, or -1 if no such m exists.

This page as a plain text file.
%I A374264 #49 Jul 05 2024 09:27:12
%S A374264 2,1,15,36,3120,551,9608,2521095,17338312921
%N A374264 a(n) is the smallest m such that A374167(m) = n, or -1 if no such m exists.
%C A374264 For n > 9, a(n) exceeds primepi(10^10) = 455052511 or is -1.
%C A374264 Conjecture: a(n) is never -1.
%e A374264 a(5) = 36 because the first 5 that appears in A374167 is A374167(36).
%Y A374264 Cf. A235266, A374167.
%K A374264 nonn,hard,more
%O A374264 2,1
%A A374264 _Jon E. Schoenfield_, Jul 02 2024
%E A374264 a(10) from _Michael S. Branicky_, Jul 05 2024