Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143112
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143112 A051731 * A032742 = sum of largest proper divisors of the divisors of n. +0
2
1, 2, 2, 4, 2, 6, 2, 8, 5, 8, 2, 14, 2, 10, 8, 16, 2, 18, 2, 20, 10, 14, 2, 30, 7, 16, 14, 26, 2, 32, 2, 32, 14, 20, 10, 44, 2, 22, 16, 44, 2, 42, 2, 38, 26, 26, 2, 62, 9, 38, 20, 44, 2, 54, 14, 58, 22, 32, 2, 80, 2, 34, 34, 64, 16, 62, 2, 56, 26, 58, 2, 96, 2, 40, 38, 62, 14, 72, 2, 92 (list; graph; listen)
OFFSET

1,2

FORMULA

A051731 * A032742, where A051731 = the inverse Mobius transform and A032742 = the largest proper divisors of n: (1, 1, 1, 3, 1, 3, 1, 4, 3, 5, 1, 6, 1, 7,...).

EXAMPLE

a(12) = 14. The divisors of 12 are shown in row 12 of triangle A127093: (1, 2, 3, 4, 0, 6, 0, 0, 0, 0, 0, 12). The largest proper divisors of these terms are (1, 1, 1, 2, 0, 3, 0, 0, 0, 0, 0, 6), sum = 14. Or, we can take row of triangle A051731: (1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1) dot (1, 1, 1, 2, 1, 3, 1, 4, 3, 5, 1, 6) = (1 + 1 + 1 + 2 + 0 + 3 + 0 + 0 + 0 + 0 + 0 + 6) = 14, where A032742 = (1, 1, 1, 2, 1, 3, 1, 4, 3, 5,...).

CROSSREFS

Cf. A051731, A127093, A032742.

Sequence in context: A107067 A046801 A137502 this_sequence A167272 A090624 A099735

Adjacent sequences: A143109 A143110 A143111 this_sequence A143113 A143114 A143115

KEYWORD

nonn

AUTHOR

Gary W. Adamson & Mats O. Granvik (qntmpkt(AT)yahoo.com), Jul 25 2008

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 19 2009

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research