Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136180
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136180 a(n) = sum{k=1 to d(n)-1) GCD(b(k),b(k+1)), where b(k) is the kth positive divisor of n and d(n) = the number of positive divisors of n. +0
4
0, 1, 1, 3, 1, 5, 1, 7, 4, 7, 1, 11, 1, 9, 7, 15, 1, 17, 1, 19, 9, 13, 1, 23, 6, 15, 13, 25, 1, 26, 1, 31, 13, 19, 9, 35, 1, 21, 15, 37, 1, 41, 1, 37, 21, 25, 1, 47, 8, 37, 19, 43, 1, 53, 13, 49, 21, 31, 1, 57, 1, 33, 27, 63, 15, 61, 1, 55, 25, 48 (list; graph; listen)
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 December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research