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

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!)
 A108803 A108802 read mod 4. 3
 1, 2, 1, 2, 0, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 2, 2, 2, 2, 2, 2, 2, 2, 3, 0, 3, 0, 3, 2, 0, 2, 1, 2, 1, 2, 1, 2, 2, 2, 3, 0, 0, 2, 0, 2, 1, 2, 3, 0, 0, 0, 0, 2, 2, 0, 0, 2, 1, 2, 2, 0, 0, 2, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 2, 1, 0, 1, 0, 2, 2, 1, 2, 0, 0, 1, 2, 3, 0, 0, 2, 0, 2, 2, 0, 3, 0, 1, 0, 2, 2, 3, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = A000712(n-1)(mod 4). - John M. Campbell, Jul 16 2016 MAPLE A000041 := proc(n) combinat[numbpart](n) ; end: A040051 := proc(n) option remember ; A000041(n) mod 2 ; end: A108802 := proc(n) option remember ; add( A040051(i)*A040051(n-i-1), i=0..n-1) ; end: A108803 := proc(n) A108802(n) mod 4 ; end: for n from 1 to 140 do printf("%d, ", A108803(n)) ; od ; # R. J. Mathar, May 08 2007 MATHEMATICA Function[w, Mod[ListConvolve[#, #], 4] & /@ Map[Take[w, #] &, Range@ Length@ w]]@ Table[Mod[PartitionsP@ n, 2], {n, 0, 105}] // Flatten (* Michael De Vlieger, Jul 16 2016 *) CROSSREFS Sequence in context: A208978 A101664 A091952 * A050601 A101650 A287411 Adjacent sequences:  A108800 A108801 A108802 * A108804 A108805 A108806 KEYWORD nonn AUTHOR N. J. A. Sloane, Jul 09 2005 EXTENSIONS More terms from R. J. Mathar, May 08 2007 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.

Last modified January 17 12:42 EST 2020. Contains 330958 sequences. (Running on oeis4.)