id:A136167 - OEIS Search Results

Search: id:A136167

Displaying 1-1 of 1 results found.

page 1

a(n) = the number of divisors of n that are each not coprime to any adjacent (previous or following) divisor of n.

+0
6

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

	OFFSET	`1,8`
	LINKS	`Diana Mecum, Table of n, a(n) for n = 1..1000`
	EXAMPLE	`The divisors of 28 are 1,2,4,7,14,28. Among adjacent pairs of divisors, 1 and 2 are coprime, and 4 and 7 are coprime. Therefore there are a(28) =2 divisors that are each not next to any divisor they are coprime to. (These two divisors are 14 and 28.)`
	CROSSREFS	`Cf. A136164, A136165, A136166.` `Sequence in context: A108947 A097608 A105469 this_sequence A140748 A070821 A051632` `Adjacent sequences: A136164 A136165 A136166 this_sequence A136168 A136169 A136170`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Dec 17 2007`
	EXTENSIONS	`More terms from Diana Mecum (diana.mecum(AT)gmail.com), Jul 13 2008`

page 1

Search completed in 0.002 seconds

Last modified September 7 23:08 EDT 2008. Contains 143486 sequences.

AT&T Labs Research