A166226 - OEIS

This site is supported by donations to The OEIS Foundation.

A166226

Bell number n modulo n

0, 0, 2, 3, 2, 5, 2, 4, 6, 5, 2, 1, 2, 12, 5, 3, 2, 13, 2, 12, 15, 5, 2, 9, 3, 18, 10, 3, 2, 27, 2, 12, 4, 5, 0, 1, 2, 24, 28, 27, 2, 23, 2, 8, 5, 5, 2, 33, 24, 20, 49, 39, 2, 5, 27, 28, 34, 5, 2, 57, 2, 36, 6, 51, 47, 19, 2, 52, 15, 25, 2, 49, 2, 42, 22, 71, 59, 19, 2, 44, 23, 5, 2, 65, 84 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`a(n) = 2 (mod n) when n is prime`
	FORMULA	`a(n) = A000110(n) mod n`
	EXAMPLE	`a(3)=a(5)=a(7)=a(11)=2`
	MATHEMATICA	`Array[n \[Function] Mod[BellB[n], n], 1000] [From J. Mulder (jasper.mulder(AT)planet.nl), Jan 28 2010]`
	CROSSREFS	`See the Bell numbers sequence A000110` `Sequence in context: A000705 A073751 A108501 * A088167 A073893 A099552` `Adjacent sequences: A166223 A166224 A166225 * A166227 A166228 A166229`
	KEYWORD	`nonn`
	AUTHOR	`Thierry Banel (tbanel(AT)gmail.com), Oct 09 2009`
	EXTENSIONS	`More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl) and J. Mulder (jasper.mulder(AT)planet.nl), Jan 25 2010`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.