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!)
A190609 a(1)=a(2)=1; thereafter a(n) = 3*(a(ceiling(n/2))-a(floor(n/2))). 2
1, 1, 0, 0, -3, 0, 0, 0, -9, 0, 9, 0, 0, 0, 0, 0, -27, 0, 27, 0, 27, 0, -27, 0, 0, 0, 0, 0, 0, 0, 0, 0, -81, 0, 81, 0, 81, 0, -81, 0, 81, 0, -81, 0, -81, 0, 81, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -243, 0, 243, 0, 243, 0, -243, 0, 243, 0, -243, 0, -243, 0, 243, 0, 243, 0, -243, 0, -243, 0, 243, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
MAPLE
f:=proc(n) option remember; local r; r:=3;
if n <= 2 then 1 else r*(f(ceil(n/2))-f(floor(n/2))); fi; end;
MATHEMATICA
a[1]=a[2]=1; a[n_]:=a[n]=3(a[Ceiling[n/2]]-a[Floor[n/2]]); Array[a, 90] (* Harvey P. Dale, Jul 20 2020 *)
CROSSREFS
Sequence in context: A342590 A209436 A229121 * A370146 A325974 A057389
KEYWORD
sign
AUTHOR
N. J. A. Sloane, May 13 2011, based on a posting by Benoit CLOITRE to the Sequence Fans Mailing List, Apr 29 2011
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 18 08:27 EDT 2024. Contains 371769 sequences. (Running on oeis4.)