id:A061008 - OEIS Search Results

Search: id:A061008

Displaying 1-1 of 1 results found.

page 1

Sum_{ 0<j<=n} (-(n-1)! mod n).

+0
4

0, 1, 2, 4, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 23, 23, 23 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(n) =a(n-1)+A061007(n) =A061009(n)+2. For n>3, a(n)=pi(n)+2 where pi(n)=A000720(n) is the number of primes less than or equal to n.`
	EXAMPLE	`a(6)=5 since (-1 mod 1) + (-1 mod 2) + (-2 mod 3) + (-6 mod 4) + (-24 mod 5) + (-120 mod 6) = 0+1+1+2+1+0 = 5.`
	MAPLE	`P:=proc(n) local a, i, k, w; a:=0; print(a); for i from 1 by 1 to n do w:=((i-1)! mod (i+1)); a:=a+w; print(a); od; end: P(1000); - Paolo P. Lava (ppl(AT)spl.at), Apr 23 2007`
	CROSSREFS	`Cf. A000040, A000142, A061006, A061007, A061009.` `Sequence in context: A034214 A131813 A083038 this_sequence A091988 A023824 A081252` `Adjacent sequences: A061005 A061006 A061007 this_sequence A061009 A061010 A061011`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 12 2001`

page 1

Search completed in 0.002 seconds

Last modified September 6 00:03 EDT 2008. Contains 143485 sequences.

AT&T Labs Research