id:A134536 - OEIS Search Results

Search: id:A134536

Displaying 1-1 of 1 results found.

page 1

a(n) = GCD(c(n),c(2n)), where c(n) is the nth composite positive integer.

+0
1

2, 3, 4, 3, 2, 3, 2, 1, 4, 2, 2, 3, 1, 6, 5, 2, 1, 4, 5, 1, 3, 1, 5, 4, 2, 1, 4, 6, 1, 3, 2, 8, 7, 1, 1, 2, 2, 1, 2, 1, 2, 5, 1, 7, 1, 1, 1, 4, 1, 7, 9, 2, 3, 1, 1, 3, 10, 9, 1, 2, 5, 2, 3, 8, 10, 1, 1, 3, 2, 1, 1, 1, 9, 4, 3, 2, 3, 1, 1, 1, 1, 4, 2, 1, 2, 1, 2, 1, 12, 11, 2, 1, 2, 1, 2, 2, 1, 10, 11, 1, 2, 5 (list; graph; listen)

	OFFSET	`1,1`
	MAPLE	`A002808 := proc(n) option remember ; local a; if n = 1 then 4; else for a from A002808(n-1)+1 do if not isprime(a) then RETURN(a) ; fi ; od: fi ; end: A134536 := proc(n) gcd( A002808(n), A002808(2*n)) ; end: seq(A134536(n), n=1..120) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 05 2008`
	CROSSREFS	`Cf. A002808.` `Sequence in context: A030340 A122453 A017849 this_sequence A131731 A111880 A101497` `Adjacent sequences: A134533 A134534 A134535 this_sequence A134537 A134538 A134539`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Jan 31 2008`
	EXTENSIONS	`More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 05 2008`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research