id:A165207 - OEIS Search Results

Search: id:A165207

Displaying 1-1 of 1 results found.

page 1

Period length 4: repeat 2, 2, 4, 4.

+0
2

2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2 (list; graph; listen)

	OFFSET	`0,1`
	FORMULA	`a(n)=2A130658(n).` `a(n) = A002378(n+1)/A156002(n+1) = A061037(4n+6)/A156002(n+1) = A061037(4n+6)/A061041(8n+12).` `a(n) = a(n-1)-a(n-2)+a(n-3). G.f.: 2(1+2x^2)/((1-x)(1+x^2)) [R. J. Mathar, Sep 11 2009]` `a(n)=3-[(1/2)-(1/2)I]I^n-[(1/2)+(1/2)I](-I)^n, with n>=0 and I=sqrt(-1). a(n)=(1/2){2(n mod 4)+[(n+1) mod 4]+[(n+3) mod 4]}, with n>=0. [From Paolo P. Lava (ppl(AT)spl.at), Sep 16 2009]`
	CROSSREFS	`Sequence in context: A097860 A098979 A071928 this_sequence A130501 A049116 A065176` `Adjacent sequences: A165204 A165205 A165206 this_sequence A165208 A165209 A165210`
	KEYWORD	`nonn,easy`
	AUTHOR	`Paul Curtz (bpcrtz(AT)free.fr), Sep 07 2009`
	EXTENSIONS	`Edited, offset set to 0, by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 11 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research