id:A086330 - OEIS Search Results

Search: id:A086330

Displaying 1-1 of 1 results found.

page 1

Sum_{m >= 2} m! mod n.

+0
1

0, 2, 4, 7, 2, 18, 8, 17, 12, 43, 8, 73, 32, 17, 24, 113, 26, 159, 12, 32, 76, 203, 8, 112, 164, 89, 60, 334, 32, 496, 88, 164, 232, 67, 44, 706, 292, 164, 32, 863, 74, 874, 164, 62, 456, 1097, 56, 291, 162, 317, 268, 1124, 116, 142, 88, 425, 566, 1560, 32, 2033, 930 (list; graph; listen)

	OFFSET	`2,2`
	COMMENT	`A discrete infinite sum that has some rough analogies to the infinite series for exponentials`
	FORMULA	`a(n) = -1+Sum_{k=1..n} A062169(n, k). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 06 2003`
	EXAMPLE	`a(7) = 2! mod 7 + 3! mod 7 + 4! mod 7 + 5! mod 7 + 6! mod 7 + 7! mod 7 + 8! mod 7 + . . . = 2 mod 7 + 6 mod 7 + 24 mod 7 + 120 mod 7 + 720 mod 7 + 5040 mod 7 + 40320 mod 7 + . . . = 2 + 6 + 3 + 1 + 6 + (all further values are zero) = 18`
	CROSSREFS	`Adjacent sequences: A086327 A086328 A086329 this_sequence A086331 A086332 A086333` `Sequence in context: A134974 A133292 A126218 this_sequence A098283 A137282 A139696`
	KEYWORD	`easy,nonn`
	AUTHOR	`Walter G. Carlini (541carlini(AT)charter.net), Aug 31 2003`
	EXTENSIONS	`Corrected and extended by Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 06 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.

AT&T Labs Research