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.

A065204 Least m such that A065203(m) = n.

This page as a plain text file.
%I A065204 #10 Aug 21 2023 16:43:30
%S A065204 1,3,22,191,2206,29054,497585
%N A065204 Least m such that A065203(m) = n.
%C A065204 Conjecture: A064413(a(n)) = A002110(n) (primorial numbers), i.e., a(n) sets positions of primorial numbers in A064413.
%Y A065204 Cf. A064413, A064742, A065203, A002110.
%K A065204 nonn,hard,more
%O A065204 1,2
%A A065204 _Vladeta Jovovic_, Oct 21 2001
%E A065204 a(6)-a(7) from _Sean A. Irvine_, Aug 21 2023