Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136166
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136166 a(n) = the number of divisors of n that are each not coprime to the previous or the following divisor of n. +0
6
0, 0, 0, 2, 0, 2, 0, 3, 2, 2, 0, 3, 0, 2, 2, 4, 0, 4, 0, 5, 2, 2, 0, 5, 2, 2, 3, 5, 0, 4, 0, 5, 2, 2, 2, 6, 0, 2, 2, 6, 0, 6, 0, 5, 3, 2, 0, 7, 2, 4, 2, 5, 0, 6, 2, 6, 2, 2, 0, 7, 0, 2, 3, 6, 2, 6, 0, 5, 2, 4, 0, 9, 0, 2, 4, 5, 2, 6, 0, 8, 4, 2, 0, 8, 2, 2, 2, 7, 0, 8, 2, 5, 2, 2, 2, 9, 0, 4, 5, 8, 0, 6, 0, 7, 4 (list; graph; listen)
OFFSET

1,4

LINKS

Diana Mecum, Table of n, a(n) for n = 1..1000

Leroy Quet, Home Page (listed in lieu of email address)

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) =5 divisors that are each next to at least one divisor they are not coprime to. (These five divisors are 2,4,7,14,28.)

CROSSREFS

Cf. A136164, A136165, A136167.

Adjacent sequences: A136163 A136164 A136165 this_sequence A136167 A136168 A136169

Sequence in context: A029188 A090290 A144494 this_sequence A046522 A112631 A096500

KEYWORD

nonn

AUTHOR

Leroy Quet, 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

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research