This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206774 First differences of A033922. 3
 0, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -4, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -4, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -4, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -6, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -4, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -4, 1, 0, 1, -1, 1, 0, 1, -1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,16 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16383 FORMULA a(n) = A033922(n) - A033922(n-1). For n >= 1, a(2n+1)=1, a(4n+2)=0, a(4*A042968(n))=-1, a(16*A042968(n))=-4, a(64*(2n+1))=-6. The values < 0 taken by the sequence are -1,-4,-6,-7, ... see A206775. PROG (PARI) up_to = 16383; A033922list(n) = { my(v, k, e); v=vector(n+1); v[1]=1; for(m=1, n, k=m; e=0; while(k>0, if(k%2, v[m+1]+=v[e+1]); e++; k\=2)); (v); }; \\ From A033922 v033922 = A033922list(16383); A033922(n) = v033922[1+n]; A206774(n) = (A033922(n)-A033922(n-1)); \\ Antti Karttunen, Nov 06 2018 CROSSREFS Cf. A033922. Sequence in context: A056968 A213541 A181435 * A290455 A290460 A295281 Adjacent sequences:  A206771 A206772 A206773 * A206775 A206776 A206777 KEYWORD sign AUTHOR Benoit Cloitre, Jan 10 2013 EXTENSIONS More terms from Antti Karttunen, Nov 06 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 23 18:13 EDT 2019. Contains 321433 sequences. (Running on oeis4.)