Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112644
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112644 Odd and square-free abundant numbers not divisible by 5. +0
2
22309287, 28129101, 30069039, 34051017, 35888853, 36399363, 38057019, 39768729, 40681641, 41708667, 43444401, 45588543, 45894849, 48141093, 48555507, 50489439, 51294243, 51408357, 53804751, 54777723, 55186131 (list; graph; listen)
OFFSET

1,1

EXAMPLE

99906807=3.7.11.13.17.19.103

MATHEMATICA

ta={{0}}; Do[g=n; s=DivisorSigma[1, n]-2*n; If[Greater[s, 0]&&Equal[Abs[MoebiusMu[n]], 1]&& !Equal[Mod[n, 2], 0]&&!Equal[Mod[n, 5], 0], Print[n, PrimeFactorList[n], s]; ta=Append[ta, n]], {n, 10000000, 100000000}]; {ta=Delete[ta, 1], g}

CROSSREFS

Cf. A087248, A046391, A112643, A112642, A112640.

Sequence in context: A133543 A034613 A118860 this_sequence A069317 A022211 A046397

Adjacent sequences: A112641 A112642 A112643 this_sequence A112645 A112646 A112647

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 20 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 August 8 13:43 EDT 2008. Contains 142651 sequences.


AT&T Labs Research