The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A290562 a(n) = n - cos(n*Pi/2). 2

%I #16 Aug 08 2017 06:54:57

%S -1,1,3,3,3,5,7,7,7,9,11,11,11,13,15,15,15,17,19,19,19,21,23,23,23,25,

%T 27,27,27,29,31,31,31,33,35,35,35,37,39,39,39,41,43,43,43,45,47,47,47,

%U 49,51,51,51,53,55,55,55,57,59,59,59,61,63,63,63,65,67

%N a(n) = n - cos(n*Pi/2).

%C a(n) divides A289870(n).

%H Colin Barker, <a href="/A290562/b290562.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,-2,2,-1).

%F G.f.: (x^3 - x^2 + 3 x - 1)/((x - 1)^2*(x^2 + 1)).

%F a(n) = n if n == 1 (mod 4), and a(n) = a(n-4) + 4 otherwise, for n>4.

%F a(n) = a(n+20) - 20.

%F a(n) = -A290561(-n).

%F a(n) + A290561(n) = 2*n.

%F a(n) * A290561(n) = n^2 - cos(n*Pi/2)^2 = A085046(n) for n>0.

%F From _Colin Barker_, Aug 08 2017: (Start)

%F a(n) = n - (-i)^n/2 - i^n/2 where i=sqrt(-1).

%F a(n) = 2*a(n-1) - 2*a(n-2) + 2*a(n-3) - a(n-4) for n>3.

%F (End)

%t a[n_] := n - Cos[n*Pi/2]; Table[a[n], {n, 0, 60}]

%o (PARI) a(n) = n - round(cos(n*Pi/2)); \\ _Michel Marcus_, Aug 06 2017

%o (PARI) Vec((x^3 - x^2 + 3*x - 1)/((x - 1)^2*(x^2 + 1)) + O(x^100)) \\ _Colin Barker_, Aug 08 2017

%Y Cf. A085046, A289870, A290561.

%K sign,easy

%O 0,3

%A _Jean-François Alcover_ and _Paul Curtz_, Aug 06 2017

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 May 13 09:49 EDT 2024. Contains 372504 sequences. (Running on oeis4.)