Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053186
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053186 Square excess of n: difference between n and largest square <= n. +0
25
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, 13 (list; graph; listen)
OFFSET

0,4

COMMENT

Comment from David Wilson (davidwwilson(AT)comcast.net), Jan 05 2009: (Start)

More generally we may consider sequences defined by:

a(n) = n^j - (largest k^th power <= n^j),

a(n) = n^j - (largest k^th power < n^j),

a(n) = (largest k^th power >= n^j) - n^j,

a(n) = (largest k^th power > n^j) - n^j,

for small values of j and k.

The present entry is the first of these with j = 1 and n = 2.

It might be interesting to add further examples to the OEIS. (End)

a(A000290(n)) = 0; a(A005563(n)) = 2*n. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2009]

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

a(n)=f(n,1) with f(n,m) = if n<m then n else f(n-m,m+2). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2009]

MAPLE

S:=proc(n) if issqr(n) then RETURN(0); fi; n-(floor(sqrt(n)))^2; end;

MATHEMATICA

f[n_] := n - (Floor@ Sqrt@ n)^2; Table[f@ n, {n, 0, 94}] [From Robert G. Wilson, v (rgwv(AT)rgwv.com), Jan 23 2009]

PROGRAM

(PARI) a(n)=if(n<0, 0, n-sqrtint(n)^2)

CROSSREFS

Cf. A002262, A048760. A071797(n)=1+a(n-1).

A002262. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2009]

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

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research