A146122 Bell numbers (A000110) read mod 32.

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

Offset: 0

Author

N. J. A. Sloane, Feb 07 2009

Keywords

• nonn
• easy

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).

Crossrefs

Cf. A000110, A146093-A146121 (Bell numbers read mod 3 to mod 31).

Cf. A054767 (periods).

Programs

Magma

[Bell(n) mod 32: n in [0..100]]; // G. C. Greubel, Feb 02 2016

Mathematica

Mod[BellB[Range[0, 100]], 32] (* G. C. Greubel, Feb 02 2016 *)

Formula

a(n) = a(n-96). [See A054767. - Jianing Song, Jun 20 2025]