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.

A177048 Least k such that k^n starts with n in base 2.

This page as a plain text file.
%I A177048 #15 Apr 14 2021 05:24:57
%S A177048 1,2,3,2,13,11,13,2,3,25,5,7,15,35,35,2,57,31,13,77,37,23,7,29,15,25,
%T A177048 3,51,27,61,5,2,43,37,57,25,17,31,13,69,75,13,49,9,13,75,99,45,103,57,
%U A177048 37,35,23,25,23,75,23,295,23,163,21,5,23,2,3,79,23,123,23,345,33,5,15
%N A177048 Least k such that k^n starts with n in base 2.
%H A177048 Seiichi Manyama, <a href="/A177048/b177048.txt">Table of n, a(n) for n = 1..5000</a>
%o A177048 (Haskell)
%o A177048 toBinary 0 = []
%o A177048 toBinary n = toBinary (n `div` 2) ++ [odd n]
%o A177048 a = [1 + fromJust (findIndex (isPrefixOf (toBinary n)) [toBinary (k ^ n) | k <- [1..]]) | n <- [1..]]
%Y A177048 Cf. A177047.
%K A177048 nonn,base,easy
%O A177048 1,2
%A A177048 _Vladimir Reshetnikov_, May 01 2010
%E A177048 More terms from _Seiichi Manyama_, Dec 22 2019