login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065651 a(n) = Sum_{k=1..n} (-1)^tau(k) = n - 2*floor(sqrt(n)). 2
0, 1, 0, 1, 2, 3, 4, 3, 4, 5, 6, 7, 8, 9, 8, 9, 10, 11, 12, 13, 14, 15, 16, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,5
LINKS
MATHEMATICA
Table[n-2*Floor[Sqrt[n]], {n, 2, 80}] (* Harvey P. Dale, Jul 27 2012 *)
PROG
(PARI) a(n) = n - 2*sqrtint(n); \\ Harry J. Smith, Oct 25 2009
(Python)
import math
def a(n): return n - 2 * math.isqrt(n) # Darío Clavijo, Apr 23 2023
CROSSREFS
Sequence in context: A227181 A268233 A309241 * A322567 A349049 A221356
KEYWORD
nonn,easy
AUTHOR
Vladeta Jovovic, Dec 03 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)