The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323887 Sum of Per Nørgård's "infinity sequence" (A004718) and its Dirichlet inverse (A323886). 7
 2, 0, 0, 1, 0, -4, 0, -1, 4, 0, 0, 2, 0, -6, 0, 1, 0, 0, 0, 0, 12, -2, 0, -2, 0, 2, 0, 3, 0, -8, 0, -1, 4, 0, 0, 2, 0, -6, -4, 0, 0, 10, 0, 1, 16, -4, 0, 2, 9, -6, 0, -1, 0, 0, 0, -3, 12, 4, 0, 4, 0, -10, -20, 1, 0, 0, 0, 0, 8, -2, 0, -2, 0, 2, 12, 3, 6, -12, 0, 0, -4, -2, 0, 1, 0, -4, -8, -1, 0, 16, -6, 2, 20, -6, 0, -2, 0, 11, 0, 3, 0, -8, 0, 1, 28 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The composer Per Nørgård's name is also written in the OEIS as Per Noergaard. LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537 FORMULA a(n) = A004718(n) + A323886(n). PROG (PARI) up_to = 65537; A004718list(up_to) = { my(v=vector(up_to)); v[1]=1; v[2]=-1; for(n=3, up_to, v[n] = if(n%2, 1+v[n>>1], -v[n/2])); (v); }; \\ After code in A004718. DirInverse(v) = { my(u=vector(#v)); u[1] = (1/v[1]); for(n=2, #v, u[n] = -sumdiv(n, d, if(d

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 January 17 20:36 EST 2020. Contains 330987 sequences. (Running on oeis4.)