A033322 - OEIS

This site is supported by donations to The OEIS Foundation.

A033322

[ 2/n ].

2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	FORMULA	`a(n)=2{1-[(n+2) mod (n+1)]}+[n!^2 mod (n+1)][(n+1)!^2 mod (n+2)] - Paolo P. Lava (paoloplava(AT)gmail.com), Aug 29 2007`
	CROSSREFS	`Sequence in context: A152137 A060838 A097470 * A130713 A085857 A056620` `Adjacent sequences: A033319 A033320 A033321 * A033323 A033324 A033325`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jeff Burch (jmburch(AT)osprey.smcm.edu)`

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

Last modified February 17 15:44 EST 2012. Contains 206050 sequences.