This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A146094 Bell numbers (A000110) mod 4. 14
 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..2500 P. Pleasants, W. Lunnon, and N. Stephens, Arithmetic properties of Bell numbers to a composite modulus I, Acta Arithmetica 35 (1979), pp. 1-16. Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,1). FORMULA a(n) = a(n-12). - Charles R Greathouse IV, Jul 06 2011 a(n) = (1/396)*(43*(n mod 12)+43*((n+1) mod 12)+10*((n+2) mod 12)-89*((n+3) mod 12)+43*((n+4) mod 12)+76*((n+5) mod 12)-89*((n+6) mod 12)+109*((n+7) mod 12)-56*((n+8) mod 12)+43*((n+9) mod 12)-23*((n+10) mod 12)+10*((n+11) mod 12)}, with n>=0. - Paolo P. Lava, Feb 13 2009 MATHEMATICA Mod[BellB[Range[0, 50]], 4] (* G. C. Greubel, Jan 30 2016 *) PROG (MAGMA) [Bell(n) mod 4: n in [0..100]]; // Vincenzo Librandi, Jan 30 2016 CROSSREFS Cf. A000110, A146093. Sequence in context: A127472 A194665 A004563 * A098035 A079055 A122170 Adjacent sequences:  A146091 A146092 A146093 * A146095 A146096 A146097 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Feb 07 2009 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 October 19 03:34 EDT 2019. Contains 328211 sequences. (Running on oeis4.)