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!)
A042959 The sequence e when b=[ 1,1,1,1,0,1,1,1,... ]. 2
1, 1, 1, 1, 1, 2, 3, 3, 3, 3, 5, 7, 9, 9, 9, 11, 15, 19, 21, 21, 25, 31, 39, 45, 49, 53, 63, 75, 87, 97, 107, 121, 143, 165, 187, 207, 233, 265, 303, 341, 381, 425, 479, 541, 611, 681, 761, 849, 951, 1063, 1185, 1315, 1465, 1631, 1817, 2019, 2241, 2483, 2755, 3051, 3379 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
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
PROG
(PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
seq(n)={my(u=vector(n, i, i<>5), v=vector(n)); for(n=1, #v, v[n]=(u[n] + EulerT(v[1..n])[n])%2); concat([1], EulerT(v))} \\ Andrew Howroyd, May 03 2021
CROSSREFS
Sequence in context: A253591 A129263 A035367 * A147815 A227246 A200924
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms a(52) 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)