A109768 - OEIS

This site is supported by donations to The OEIS Foundation.

A109768

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

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; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`The first time the inequality a(n)>5 occurs for n=A196628(2)=3783 with a(3783)=26665. [From Max Alekseyev, Oct 04 2011]`
	REFERENCES	`Suggested by Max Alekseyev (maxale(AT)gmail.com) in a Seqfan memo Aug 09, 2005.`
	CROSSREFS	`Cf. A196627, A196628` `Sequence in context: A075463 A026518 A051008 * A069293 A066803 A089608` `Adjacent sequences: A109765 A109766 A109767 * A109769 A109770 A109771`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Aug 13 2005`

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

Last modified February 17 16:26 EST 2012. Contains 206050 sequences.