id:A064770 - OEIS Search Results

Search: id:A064770

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`0,5`
	COMMENT	`The graph of this sequence is fractal-like.` `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 (reinhard.zumkeller(AT)gmail.com), Dec 30 2007`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 0..9999` `O. Gerard, Fractal behavior of this sequence (1)` `O. Gerard, Fractal behavior of this sequence (2)`
	EXAMPLE	`26 -> [1.414...][2.449...] -> 12, so a(26) = 12.`
	MATHEMATICA	`Table[ FromDigits[ Floor[ Sqrt[ IntegerDigits[ n]]]], {n, 0, 100} ]`
	CROSSREFS	`Sequence in context: A079954 A079629 A029116 this_sequence A060467 A125918 A083533` `Adjacent sequences: A064767 A064768 A064769 this_sequence A064771 A064772 A064773`
	KEYWORD	`base,nonn,nice`
	AUTHOR	`Santi Spadaro (spados(AT)katamail.com), Oct 19 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research