id:A091084 - OEIS Search Results

Search: id:A091084

Displaying 1-1 of 1 results found.

page 1

mod(A001045(n),10).

+0
1

0, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5, 1, 1, 3, 5 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`A001045(0), followed by A001045(1), A001045(2), A001045(3), A001045(4) repeating.`
	FORMULA	`G.f.: x(1+x+3x^2+5x^3)/(1-x^4); E.g.f.: 2cos(x)-sin(x)+exp(-x)/2+5exp(x)/2-5; a(n)=2cos(pin/2)-sin(pin/2)+(-1)^n/2+5/2-50^n.` `a(n)=-(1/12){(n mod 4)+[(n+1) mod 4]-5[(n+2) mod 4]-17[(n+3) mod 4]}-5[C(2n,n) mod 2], with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 16 2008`
	CROSSREFS	`Sequence in context: A030588 A123701 A074903 this_sequence A016610 A010261 A005699` `Adjacent sequences: A091081 A091082 A091083 this_sequence A091085 A091086 A091087`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 18 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research