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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A042952 The sequence d when b=[ 1,0,1,1,1,... ]. 2
 1, 2, 3, 4, 5, 6, 7, 9, 12, 13, 17, 18, 19, 21, 25, 27, 30, 31, 32, 35, 38, 41, 42, 47, 50, 54, 59, 61, 62, 63, 68, 73, 76, 78, 80, 81, 83, 84, 89, 90, 91, 94, 96, 97, 101, 102, 103, 104, 108, 112, 114, 118, 119, 120, 125, 126, 128, 130, 131, 133, 139, 144, 150, 157, 160 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Map a binary sequence b=[ b_1,... ] to a binary sequence c=[ c_1,... ] so that C=1/Product (1-x^i)^c_i == 1+Sum b_i*x^i (mod 2). This produces 2 new sequences: d={i:c_i=1} and e=[ 1,e_1,... ] where C=1+Sum e_i*x^i. LINKS Andrew Howroyd, Table of n, a(n) for n = 0..302 PROG (PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)} upto(n)={my(u=vector(n, i, i<>2), v=vector(n)); for(n=1, #v, v[n]=(u[n] + EulerT(v[1..n])[n])%2); select(t->t, v, 1)} \\ Andrew Howroyd, May 03 2021 CROSSREFS Cf. A042953, A042954, A042956, A042958. Sequence in context: A072966 A245761 A059759 * A126327 A328116 A193286 Adjacent sequences:  A042949 A042950 A042951 * A042953 A042954 A042955 KEYWORD nonn AUTHOR EXTENSIONS Terms a(35) and beyond from Andrew Howroyd, May 03 2021 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 December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)