Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136183
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136183 a(n) = Sum_{k=1 to d(n)-1} LCM(b(k),b(k+1)), where b(k) is the kth positive divisor of n and d(n) = number of positive divisors of n. +0
4
0, 2, 3, 6, 5, 14, 7, 14, 12, 22, 11, 44, 13, 30, 33, 30, 17, 50, 19, 56, 45, 46, 23, 104, 30, 54, 39, 76, 29, 143, 31, 62, 69, 70, 75, 158, 37, 78, 81, 166, 41, 154, 43, 116, 153, 94, 47, 224, 56, 122, 105, 136, 53, 158, 115, 230, 117, 118, 59, 400, 61, 126, 213, 126, 135 (list; graph; listen)
page 1

Search completed in 0.001 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 10 12:05 EST 2009. Contains 170568 sequences.


AT&T Labs Research