id:A109768 - OEIS Search Results

Search: id:A109768

Displaying 1-1 of 1 results found.

page 1

gcd(3^n-2,2^n-3).

+0
1

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

	OFFSET	`1,3`
	COMMENT	`The sequence appears to be periodic with period (1,1,5,1) of length 4.`
	REFERENCES	`Suggested by Max Alekseyev (maxal(AT)cs.ucsd.edu) in a Seqfan memo Aug 09, 2005.`
	FORMULA	`a(n) = 2 + 2cos[(n+2)Pi/2] + (-1)^n; a(n) = (1/3){n mod 4 + 4[(n+1) mod 4] - 2*[(n+2) mod 4] +(n+3) mod 4} with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Nov 21 2006`
	CROSSREFS	`Sequence in context: A075463 A026518 A051008 this_sequence A069293 A066803 A089608` `Adjacent sequences: A109765 A109766 A109767 this_sequence A109769 A109770 A109771`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Aug 13 2005`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research