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!)
A099990 a(n) = Moebius(2n+1). 5

%I #21 Jul 23 2023 06:07:29

%S 1,-1,-1,-1,0,-1,-1,1,-1,-1,1,-1,0,0,-1,-1,1,1,-1,1,-1,-1,0,-1,0,1,-1,

%T 1,1,-1,-1,0,1,-1,1,-1,-1,0,1,-1,0,-1,1,1,-1,1,1,1,-1,0,-1,-1,-1,-1,

%U -1,1,-1,1,0,1,0,1,0,-1,1,-1,1,0,-1,-1,1,1,1,0,-1,-1,0,1,-1,1,1,-1,-1,-1,0,0,-1,0,1,-1,-1,1,1,1,0,-1,-1,-1,-1,-1,1,1,1,0,1

%N a(n) = Moebius(2n+1).

%H Amiram Eldar, <a href="/A099990/b099990.txt">Table of n, a(n) for n = 0..10000</a>

%H J. W. Coltman, <a href="https://doi.org/10.1364/JOSA.44.000468">The Specification of Imaging Properties by Response to a Sine Wave Input</a>, J. Opt. Soc. Am., JOSA 44, 468 (1954).

%H R. L. Lucke, <a href="https://doi.org/10.1364/AO.37.007248">Deriving the Coltman Correction for Transforming the Bar Transfer Function to the Optical Transfer Function (or the Contrast Transfer Function to the Modulation Transfer Function)</a>, Appl. Opt. 37, 7248 (1998).

%t a[n_] := MoebiusMu[2*n + 1]; Array[a, 100, 0] (* _Amiram Eldar_, Jul 23 2023 *)

%o (PARI) a(n) = moebius(2*n+1); \\ _Michel Marcus_, Aug 12 2021

%Y Bisection of A008683.

%Y Cf. A099991.

%K sign,easy

%O 0,1

%A _N. J. A. Sloane_, Nov 20 2004

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 13:41 EDT 2024. Contains 371914 sequences. (Running on oeis4.)