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!)
A042953 The sequence e when b=[ 1,0,1,1,1,... ]. 3
1, 1, 2, 3, 5, 7, 11, 15, 21, 29, 39, 51, 69, 89, 115, 147, 187, 235, 297, 369, 457, 565, 693, 845, 1031, 1249, 1507, 1815, 2175, 2597, 3099, 3681, 4359, 5153, 6073, 7137, 8377, 9803, 11447, 13345, 15521, 18013, 20881, 24151, 27885, 32149, 36999, 42509, 48783, 55885, 63931 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
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<>2), 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: A035969 A355027 A332745 * A023028 A246579 A232480
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms a(42) 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 24 19:56 EDT 2024. Contains 371963 sequences. (Running on oeis4.)