A091086 - OEIS

This site is supported by donations to The OEIS Foundation.

A091086

mod(A000975(n),10).

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

	OFFSET	`0,3`
	COMMENTS	`A000975(0), A000975(1), A000975(2), A000975(3) repeating.`
	FORMULA	`G.f.: x(1+2x+5x^2)/(1-x^4); E.g.f.: 2exp(x)-exp(-x)-cos(x)-2sin(x); a(n)=2-(-1)^n-cos(pin/2)-2sin(pin/2).` `a(n)=(1/12){19(n mod 4)-5*[(n+1) mod 4]+[(n+2) mod 4]+[(n+3) mod 4]}, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Jul 16 2008`
	CROSSREFS	`Sequence in context: A159986 A065452 A004598 * A118349 A011183 A005671` `Adjacent sequences: A091083 A091084 A091085 * A091087 A091088 A091089`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 18 2003`

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

Last modified February 14 08:49 EST 2012. Contains 205614 sequences.