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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A320667 First differences of A066194. 0
 1, 2, -1, 5, -1, -2, 1, 10, -1, -2, 1, -5, 1, 2, -1, 21, -1, -2, 1, -5, 1, 2, -1, -10, 1, 2, -1, 5, -1, -2, 1, 42, -1, -2, 1, -5, 1, 2, -1, -10, 1, 2, -1, 5, -1, -2, 1, -21, 1, 2, -1, 5, -1, -2, 1, 10, -1, -2, 1, -5, 1, 2, -1, 85, -1, -2, 1, -5, 1, 2, -1, -10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..72. FORMULA a(n) = A066194(n+1) - A066194(n). a(n) = (1/6)*(-3 + (-1)^A007814(n) + 2^(A007814(n)+3))*(-1)^(A000120(n)+1). EXAMPLE To obtain the first 2^n-1 entries if you have the first 2^(n-1)-1 entries, adjoin 1/6 (-3 + (-1)^(1 + n) + 2^(2 + n)) to the right end of the list, negate the signs of the first 2^(n-1)-1 entries, and then adjoin that list to the right. For example for n=3 {1,2,-1} becomes {1,2,-1,5,-1,-2,1}. MATHEMATICA Fold[Join[#1, {#2}, -#1] &, {1}, Table[1/6 (-3 + (-1)^(1 + n) + 2^(2 + n)), {n, 2, 6}]] t[n_/; IntegerQ[Log2[n]]]:=1/6 (-3 + (-1)^IntegerExponent[n, 2] + 8*n); t[n_/; Not[IntegerQ[Log2[n]]]]:=-t[n-2^Floor[Log2[n]]]; Table[t[j], {j, 1, 15}](* recursive formulation *) Table[1/6 (-3+(-1)^IntegerExponent[j, 2]+2^(IntegerExponent[j, 2]+3))(-1)^(Total[IntegerDigits[j, 2]]+1), {j, 1, 15}] (* closed form *) CROSSREFS Cf. A066194. Sequence in context: A352566 A246964 A157334 * A236313 A222481 A351954 Adjacent sequences: A320664 A320665 A320666 * A320668 A320669 A320670 KEYWORD sign AUTHOR John Erickson, Oct 18 2018 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.

Last modified April 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)