

A064770


Replace each digit of n with the floor of its square root.


5



0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 10, 11, 11, 11, 12, 12, 12, 12, 12, 13, 10, 11, 11, 11, 12, 12, 12, 12, 12, 13, 10, 11, 11, 11, 12, 12, 12, 12, 12, 13, 20, 21, 21, 21, 22, 22, 22, 22, 22, 23, 20, 21, 21, 21, 22, 22, 22, 22, 22, 23, 20, 21, 21, 21, 22, 22, 22, 22, 22, 23
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,5


COMMENTS

The graph of this sequence is fractallike.
a(A007088(n))=A007088(n); a(A136399(n))<>A136399(n); a(a(n))=A136400(n); a(A136400(n))=A136400(n); A136428(n)=a(n+1)a(n).  Reinhard Zumkeller, Dec 30 2007


LINKS

R. Zumkeller, Table of n, a(n) for n = 0..9999
O. Gerard, Fractal behavior of this sequence (1) [broken link?]


EXAMPLE

26 > [1.414...][2.449...] > 12, so a(26) = 12.


MATHEMATICA

Table[ FromDigits[ Floor[ Sqrt[ IntegerDigits[ n]]]], {n, 0, 100} ]


PROG

(Haskell)
import Data.Char (digitToInt)
a064770 :: Integer > Integer
a064770 = read . map (("0111222223" !!) . digitToInt) . show
 Reinhard Zumkeller, Aug 24 2011


CROSSREFS

Sequence in context: A114968 A079629 A029116 * A322073 A060467 A125918
Adjacent sequences: A064767 A064768 A064769 * A064771 A064772 A064773


KEYWORD

base,nonn,nice,look


AUTHOR

Santi Spadaro, Oct 19 2001


STATUS

approved



