Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129486
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129486 Odd unitary abundant numbers that are not odd, squarefree, ordinary abundant numbers. +0
2
195195, 333795, 416955, 1786785, 1996995, 2417415, 2807805, 3138135, 3318315, 3708705, 3798795, 4103715, 4339335, 4489485, 4789785, 4967655, 5120115, 5420415, 5552085, 5660655, 5731635, 6051045, 6111105, 6263565, 6342105 (list; graph; listen)
OFFSET

1,1

COMMENT

The first 50 members of A129485 and A112643 are the same. However, the sequences differ thereafter and this sequence contains those integers that are included in A129485 but are not included in A112643.

LINKS

Eric Weisstein, Unitary Divisor.

FORMULA

The complement of A129485 and A112643.

EXAMPLE

The third integer which is an odd unitary abundant number but is not an ordinary, squarefree abundant number is 416955. Hence a(3)=416955.

MATHEMATICA

UnitaryDivisors[ n_Integer?Positive ] := Select[ Divisors[ n ], GCD[ #, n/# ] == 1 & ]; sstar[ n_ ] := Plus @@ UnitaryDivisors[ n ] - n; UnitaryAbundantNumberQ[ k_ ] := If[ sstar[ k ] > k, True, False ]; data1 = Select[ Range[ 1, 10^7, 2 ], UnitaryAbundantNumberQ[ # ] & ]; data2 = Select[ Range[ 1, 10^7, 2 ], DivisorSigma[ 1, # ] - 2 # > 0 && ! MoebiusMu[ # ] == 0 & ]; Complement[ data1, data2 ]

CROSSREFS

Cf. A034683, A129485, A034460, A034448, A129487, A002827, A129468, A112643.

Sequence in context: A131907 A013901 A069305 this_sequence A074388 A008408 A001942

Adjacent sequences: A129483 A129484 A129485 this_sequence A129487 A129488 A129489

KEYWORD

easy,nonn

AUTHOR

Ant King (mathstutoring(AT)ntlworld.com), Apr 17 2007

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