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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A041002 The sequence d, given that c is a left shift by one place of b. 3
1, 3, 4, 7, 14, 18, 19, 20, 22, 23, 25, 26, 28, 29, 30, 31, 35, 36, 37, 38, 40, 41, 42, 45, 48, 49, 50, 52 (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..27.

CROSSREFS

Cf. A041002-A041004.

Sequence in context: A254310 A121174 A050071 * A062203 A095063 A003242

Adjacent sequences:  A040999 A041000 A041001 * A041003 A041004 A041005

KEYWORD

nonn,easy,eigen

AUTHOR

N. J. A. Sloane.

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 21 11:39 EST 2019. Contains 319354 sequences. (Running on oeis4.)