Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141676
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141676 Numbers n such that: Mod[DivisorSigma[0, n]*PrimePi[n], 8] == 0. +0
1
1, 7, 8, 10, 14, 15, 19, 20, 21, 22, 24, 30, 37, 38, 39, 40, 42, 46, 53, 54, 55, 56, 57, 58, 62, 65, 66, 70, 71, 72, 78, 82, 88, 89, 90, 91, 92, 93, 94, 95, 96, 102, 104, 105, 107, 108, 110, 114, 115, 118, 119, 120, 122, 123, 125, 126, 128, 130, 131, 132, 133, 134, 135 (list; graph; listen)
OFFSET

1,2

COMMENT

Nearly 50% of all integers fall in this category.

Mod[DivisorSigma[0, n]*PrimePi[n], 8] == 4

is the next biggest category.

I was looking at

a(n)=DivisorSigma[0, n]*PrimePi[n];

and noticed it give a plot with nearly 8 line levels.

FORMULA

a(n) =If[Mod[DivisorSigma[0, n]*PrimePi[n], 8] == 0,n]

MATHEMATICA

Flatten[Table[If[Mod[DivisorSigma[0, n]*PrimePi[n], 8] == 0, n, {}], {n, 1, 200}]]

CROSSREFS

Sequence in context: A067529 A080113 A048588 this_sequence A127164 A153972 A111064

Adjacent sequences: A141673 A141674 A141675 this_sequence A141677 A141678 A141679

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 07 2008

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research