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.

A262438 Number of digits of hexadecimal representation of n.

This page as a plain text file.
%I A262438 #15 Dec 14 2015 05:18:55
%S A262438 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%T A262438 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U A262438 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2
%N A262438 Number of digits of hexadecimal representation of n.
%C A262438 Length of n-th row in A262437.
%H A262438 Reinhard Zumkeller, <a href="/A262438/b262438.txt">Table of n, a(n) for n = 0..10000</a>
%p A262438 A262438 := proc(n)
%p A262438     if n =0 then
%p A262438         1;
%p A262438     else
%p A262438         1+floor(log[16](n)) ;
%p A262438     end if;
%p A262438 end proc: # _R. J. Mathar_, Dec 14 2015
%o A262438 (Haskell)
%o A262438 a262438 = length . a262437_row
%o A262438 (PARI) a(n) = if (n, #digits(n, 16), 1); \\ _Michel Marcus_, Dec 14 2015
%Y A262438 Cf. A262437, A055642, A070939, A081604.
%K A262438 nonn,base
%O A262438 0,17
%A A262438 _Reinhard Zumkeller_, Sep 22 2015