id:A123314 - OEIS Search Results

Search: id:A123314

Displaying 1-1 of 1 results found.

page 1

Number of times the n-th squarefree number occurs as maximal greatest common divisor of pairs of distinct squarefree numbers.

+0
3

4, 0, 2, 3, 0, 5, 0, 2, 2, 0, 3, 3, 3, 2, 0, 6, 0, 3, 0, 2, 3, 0, 3, 2, 0, 2, 3, 0, 5, 0, 4, 3, 3, 3, 2, 0, 2, 4, 0, 3, 0, 2, 3, 0, 3, 3, 0, 3, 0, 5, 0, 2, 2, 0, 2, 3, 3, 2, 0, 3, 5, 3, 0, 2, 3, 0, 3, 3, 0, 2, 3, 0, 5, 0, 3, 0, 5, 3, 2, 0, 3, 5, 0, 2, 0, 2, 3, 0, 2, 4, 0, 3, 5, 0, 3, 2, 0, 3, 2, 3, 2, 0, 6, 0, 4 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n) > 0 iff A005117(n) is an odd squarefree number: a(A100112(A056911(n)))>0;` `a(n) = 0 iff A005117(n) is an even squarefree number: a(A100112(A039956(n)))=0.`
	FORMULA	`a(n) = #{k: A123313(k) = A005117(n)}.`
	CROSSREFS	`Sequence in context: A087604 A090538 A109157 this_sequence A058997 A021881 A021717` `Adjacent sequences: A123311 A123312 A123313 this_sequence A123315 A123316 A123317`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Sep 25 2006`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research