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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A146122 Bell numbers (A000110) read mod 32. 5
 1, 1, 2, 5, 15, 20, 11, 13, 12, 27, 7, 10, 29, 21, 26, 17, 3, 12, 15, 1, 12, 15, 27, 26, 9, 25, 18, 13, 7, 4, 3, 5, 12, 19, 31, 10, 5, 13, 10, 25, 27, 28, 7, 25, 12, 7, 19, 26, 17, 17, 2, 21, 31, 20, 27, 29, 12, 11, 23, 10, 13, 5, 26, 1, 19, 12, 31, 17, 12, 31, 11, 26, 25, 9, 18, 29, 23 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..10000 W. F. Lunnon, P. A. B. Pleasants, and N. M. 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). FORMULA a(n) = a(n-96). MATHEMATICA Mod[BellB[Range[0, 100]], 32] (* G. C. Greubel, Feb 02 2016 *) PROG (MAGMA) [Bell(n) mod 32: n in [0..100]]; // G. C. Greubel, Feb 02 2016 CROSSREFS Cf. A000110, A146116, A146117, A146118, A146119, A146120, A146121. Sequence in context: A146108 A032841 A058221 * A263457 A146121 A066883 Adjacent sequences:  A146119 A146120 A146121 * A146123 A146124 A146125 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 April 14 23:46 EDT 2021. Contains 342971 sequences. (Running on oeis4.)