OFFSET
1,3
COMMENTS
a(n) = 2 (mod n) when n is prime.
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..10000
Greg Hurst, Andrew Schultz, An elementary (number theory) proof of Touchard's congruence, arXiv:0906.0696 [math.CO], (2009)
FORMULA
a(n) = A000110(n) mod n.
a(p^m) = m+1 (mod p) when p is prime and m >= 1 (see Lemma 3.1 in the Hurst/Schultz reference). - Joerg Arndt, Jun 01 2016
EXAMPLE
a(3)=a(5)=a(7)=a(11)=2.
MAPLE
seq(combinat:-bell(n) mod n, n=1..100); # Robert Israel, Feb 03 2016
MATHEMATICA
Array[n \[Function] Mod[BellB[n], n], 1000] (* J. Mulder (jasper.mulder(AT)planet.nl), Jan 28 2010 *)
Table[Mod[BellB[n], n], {n, 1, 100}] (* G. C. Greubel, Feb 02 2016 *)
PROG
(Magma) [Bell(n) mod n: n in [1..100]]; Vincenzo Librandi, Feb 03 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Thierry Banel (tbanel(AT)gmail.com), Oct 09 2009
EXTENSIONS
More terms from R. J. Mathar and J. Mulder (jasper.mulder(AT)planet.nl), Jan 25 2010
STATUS
approved