Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A042961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A042961 The sequence e when b is obtained by reversing the parity of Euler's partition function A000041. +0
1
1, 0, 1, 0, 2, 0, 2, 0, 3, 1, 3, 1, 4, 2, 4, 3, 6, 4, 8, 5, 10, 7, 13, 8, 16, 11, 19, 15, 23, 18, 29, 25, 34, 30, 43, 38, 54, 46, 64, 58, 79, 68, 93, 86, 112, 105 (list; graph; listen)
OFFSET

0,5

COMMENT

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.

CROSSREFS

Sequence in context: A094098 A124137 A025804 this_sequence A029190 A029189 A035432

Adjacent sequences: A042958 A042959 A042960 this_sequence A042962 A042963 A042964

KEYWORD

nonn

AUTHOR

njas and J. H. Conway (conway(AT)math.princeton.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research