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.

A052345 Least k such that A052343(k)=n.

This page as a plain text file.
%I A052345 #9 Aug 21 2016 11:05:51
%S A052345 5,1,6,81,276,1056,1381,50781,6906,17956,34531,660156,40056,4462656,
%T A052345 305256,448906,200281,412597656,520731,12397766113281,1001406,
%U A052345 11222656,539550781,7631406,1482081,75865156,422394133,8852431,25035156,161170959472656
%N A052345 Least k such that A052343(k)=n.
%H A052345 Kenneth Korbin, <a href="http://www.jstor.org/stable/2687550">Problem 665</a>, The College Mathematics Journal Vol. 30 No. 5, Nov. 1999.
%Y A052345 Cf. A052343, A052344, A052346, A052347, A052348, A053587.
%K A052345 nonn
%O A052345 0,1
%A A052345 _Christian G. Bower_, Jan 23 2000
%E A052345 a(19) and a(29) from _Max Alekseyev_, Mar 09 2009
%E A052345 a(19) corrected by _Max Alekseyev_, Mar 11 2009