login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079644 n (mod sqrtint(n)). 1
0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 2, 0, 1, 2, 0, 0, 1, 2, 3, 0, 1, 2, 3, 0, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 0, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 0, 1, 2, 3, 4, 5 (list; graph; refs; listen; history; internal format)
OFFSET

1,11

FORMULA

a(A006446(n))=0; a(A033638(n))=1

MATHEMATICA

A079644[n_]:=Mod[n, Floor[n^(1/2)]; Array[A079644, 200] (* Enrique Pérez Herrero, Oct 06 2011 *)

PROG

(PARI) a(n)=n%sqrtint(n)

CROSSREFS

Sequence in context: A085496 A180160 A101661 * A072705 A072574 A058650

Adjacent sequences:  A079641 A079642 A079643 * A079645 A079646 A079647

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 31 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:05 EST 2012. Contains 205782 sequences.