Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104886 Sequence A048138, the number of times that a positive integer occurs as the sum of proper divisors, if Goldbach partitions (two odd primes, which account for most of the values) are ignored. +0
1
0, 1, 1, 0, 2, 1, 2, 0, 1, 0, 1, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 1, 0, 1, 2, 2, 1, 1, 0, 1, 0, 1, 0, 3, 1, 2, 1, 2, 0, 2, 0, 1, 1, 2, 0, 0, 0, 2, 1, 1, 2, 1, 0, 1, 0, 2, 1, 3, 1, 1, 0, 1, 0, 1, 0, 1, 2, 3, 0, 3, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 1, 0, 1, 2, 0, 2, 0, 1, 0, 0, 2 (list; graph; listen)
OFFSET

2,5

FORMULA

a(n) = number of m such that the sum of the proper divisors of m is n, ignoring m if m is the product of two different odd primes.

EXAMPLE

a(13)=1 because s(27)=1+3+9 and s(35)=1+5+7=13 however 35's factors 3 and 5 are a Goldbach partition, so 35 is not counted.

CROSSREFS

Cf. A048138, A001065, A061358.

Sequence in context: A079549 A070088 A131851 this_sequence A139351 A125925 A036578

Adjacent sequences: A104883 A104884 A104885 this_sequence A104887 A104888 A104889

KEYWORD

nonn

AUTHOR

Nathan McNew (agreatnate(AT)yahoo.com), Mar 29 2005

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research