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

%I #35 Apr 25 2023 19:13:51

%S 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,

%T 20,21,22,23,24,25,24,25,26,27,28,29,30,31,32,33,34,35,36,35,36,37,38,

%U 39,40,41,42,43,44,45,46,47,48,49,48,49,50,51,52,53,54,55,56,57,58,59

%N a(n) = Sum_{k=1..n} (-1)^tau(k) = n - 2*floor(sqrt(n)).

%H Harry J. Smith, <a href="/A065651/b065651.txt">Table of n, a(n) for n = 2..1000</a>

%t Table[n-2*Floor[Sqrt[n]],{n,2,80}] (* _Harvey P. Dale_, Jul 27 2012 *)

%o (PARI) a(n) = n - 2*sqrtint(n); \\ _Harry J. Smith_, Oct 25 2009

%o (Python)

%o import math

%o def a(n): return n - 2 * math.isqrt(n) # _DarĂ­o Clavijo_, Apr 23 2023

%Y Cf. A000005 (tau), A000196, A028391, A028392.

%K nonn,easy

%O 2,5

%A _Vladeta Jovovic_, Dec 03 2001

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 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)