login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A042952 The sequence d when b=[ 1,0,1,1,1,.. ]. 0
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 (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

Table of n, a(n) for n=0..34.

CROSSREFS

Sequence in context: A072966 A245761 A059759 * A126327 A193286 A098132

Adjacent sequences:  A042949 A042950 A042951 * A042953 A042954 A042955

KEYWORD

nonn

AUTHOR

N. J. A. Sloane and J. H. Conway

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 17:06 EST 2018. Contains 318049 sequences. (Running on oeis4.)