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.

A304039 Least number k such that A304036(k) = n.

This page as a plain text file.
%I A304039 #17 May 06 2018 02:27:17
%S A304039 0,2,6,24,26,124,122,126,722,728,726,750,746,5046,5064,5164,5070,5066,
%T A304039 5162,40370,5166,40350,40346,40464,40448,40442,40466,362906,40446,
%U A304039 41046,41070,363008,363002,41066,363026,363628,363006,367948,364346,363624,363606,368044
%N A304039 Least number k such that A304036(k) = n.
%H A304039 Rémy Sigrist, <a href="/A304039/b304039.txt">Table of n, a(n) for n = 1..163</a> (first 71 terms from Seiichi Manyama)
%e A304039 n | a(n) |
%e A304039 --+------+-------------------------------------------------------
%e A304039 2 |   2  | 2, 1+1
%e A304039 3 |   6  | 6, 2+2+2, 2+2+1+1
%e A304039 4 |  24  | 24, 6+6+6+6, 6+6+6+2+2+2, 6+6+6+2+2+1+1
%e A304039 5 |  26  | 24+2, 24+1+1, 6+6+6+6+2, 6+6+6+6+1+1, 6+6+6+2+2+2+1+1
%Y A304039 Cf. A304036.
%K A304039 nonn
%O A304039 1,2
%A A304039 _Seiichi Manyama_, May 05 2018