id:A070956 - OEIS Search Results

Search: id:A070956

Displaying 1-1 of 1 results found.

page 1

Number of pairs (x,y) such that n=GCD(x,y)+LCM(x,y).

+0
1

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

	OFFSET	`1,4`
	COMMENT	`a(n)=1 for n prime = 2,3,5,17... a(n)=2 if n=4,9, or n is in A067466(k).`
	CROSSREFS	`Sequence in context: A075256 A001480 A110917 this_sequence A007828 A070804 A104481` `Adjacent sequences: A070953 A070954 A070955 this_sequence A070957 A070958 A070959`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 16 2002`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research