Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060278
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060278 Sum of composite divisors of n less than n. +0
4
0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 10, 0, 0, 0, 12, 0, 15, 0, 14, 0, 0, 0, 30, 0, 0, 9, 18, 0, 31, 0, 28, 0, 0, 0, 49, 0, 0, 0, 42, 0, 41, 0, 26, 24, 0, 0, 70, 0, 35, 0, 30, 0, 60, 0, 54, 0, 0, 0, 97, 0, 0, 30, 60, 0, 61, 0, 38, 0, 59, 0, 117, 0, 0, 40, 42, 0, 71, 0, 98, 36, 0, 0, 127, 0, 0, 0 (list; graph; listen)
OFFSET

1,8

LINKS

Matthew M. Conroy, Home page (listed instead of email address)

MAPLE

for n from 1 to 300 do s := 0: for j from 2 to n-1 do if isprime(j) then else if n mod j = 0 then s := s+j fi; fi: od: printf(`%d, `, s) od:

CROSSREFS

Cf. A000203, A035322, A035321, A023891.

Sequence in context: A003194 A105570 A101419 this_sequence A046770 A046782 A074037

Adjacent sequences: A060275 A060276 A060277 this_sequence A060279 A060280 A060281

KEYWORD

nonn,easy

AUTHOR

Jack Brennen (jb(AT)brennen.net), Mar 28 2001

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu) and Matthew M. Conroy, Mar 29 2001

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 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research