id:A053186 - OEIS Search Results

Search: id:A053186

Displaying 1-1 of 1 results found.

page 1

Square excess of n: difference between n and largest square <= n.

+0
23

0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 (list; graph; listen)

	OFFSET	`0,4`
	REFERENCES	`S. H. Weintraub, An interesting recursion, Amer. Math. Monthly, 111 (No. 6, 2004), 528-530.`
	LINKS	`H. Bottomley, Illustration of A000196, A048760, A053186` `M. Somos, Sequences used for indexing triangular or square arrays`
	FORMULA	`a(n) = n-A048760(n) =n-floor(sqrt(n))^2`
	MAPLE	`S:=proc(n) if issqr(n) then RETURN(0); fi; n-(floor(sqrt(n)))^2; end;`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, n-sqrtint(n)^2)`
	CROSSREFS	`Cf. A002262, A048760. A071797(n)=1+a(n-1).` `Sequence in context: A119464 A107017 A049260 this_sequence A066628 A135317 A115218` `Adjacent sequences: A053183 A053184 A053185 this_sequence A053187 A053188 A053189`
	KEYWORD	`easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 01 2000`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research