A146107 Bell numbers (A000110) read mod 17.

1, 1, 2, 5, 15, 1, 16, 10, 9, 16, 1, 15, 11, 6, 15, 11, 14, 2, 3, 7, 3, 16, 0, 9, 2, 8, 0, 16, 9, 0, 4, 9, 8, 16, 5, 10, 10, 2, 16, 9, 11, 10, 8, 16, 8, 9, 4, 13, 0, 7, 4, 15, 3, 12, 1, 8, 3, 4, 1, 7, 7, 0, 13, 0, 13, 7, 11, 2, 1, 15, 13, 9, 11, 7, 5, 8, 14, 7, 13, 13, 13, 3, 1, 13, 3, 16, 11, 5, 3

Offset: 0

Author

N. J. A. Sloane, Feb 07 2009

Keywords

• nonn

Comments

Conjecture: a(n+51702516367896047761) = a(n). - G. C. Greubel, Feb 01 2016 [Conjecture is correct; see A054767. - Jianing Song, Jun 20 2025]

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, order 51702516367896047761.

Crossrefs

Cf. A000110, A146093-A146122 (Bell numbers read mod 3 to mod 32).

Cf. A054767 (periods).

Programs

Magma

[Bell(n) mod 17: n in [0..100]]; // Vincenzo Librandi, Feb 02 2016

Mathematica

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