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

 

Logo

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!)
A042956 The sequence d when b=[ 1,1,1,0,1,1,.. ]. 0
1, 4, 5, 8, 9, 10, 13, 14, 16, 17, 19, 20, 21, 24, 25, 26, 27, 28, 30, 31, 34, 35, 36, 40, 41, 47, 48, 52, 56, 59, 60, 61, 63, 64, 70, 72, 73, 78 (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..37.

CROSSREFS

Sequence in context: A154885 A292192 A295150 * A128217 A288671 A284906

Adjacent sequences:  A042953 A042954 A042955 * A042957 A042958 A042959

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 January 23 19:12 EST 2020. Contains 331175 sequences. (Running on oeis4.)