Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088145
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088145 Let p = prime(n); then a(n) = (Sum(primitiveroots of p) + moebius(p-1))/p. +0
1
0, 1, 1, 1, 2, 2, 4, 3, 6, 6, 4, 6, 8, 6, 13, 12, 15, 8, 10, 15, 12, 14, 21, 20, 16, 20, 18, 27, 18, 24, 19, 27, 32, 24, 36, 22, 24, 28, 46, 42, 46, 24, 42, 32, 42, 35, 27, 34, 58, 36, 56, 53, 32, 52, 64, 71, 66, 39, 44, 48, 48, 72, 48, 66, 48, 78, 44, 48, 88, 56, 80 (list; graph; listen)
OFFSET

1,5

MATHEMATICA

PrimitiveRootQ[ a_Integer, p_Integer ] := Block[ {fac, res}, fac = FactorInteger[ p - 1 ]; res = Table[ PowerMod[ a, ( p - 1)/fac[ [ i, 1 ] ], p ], {i, Length[ fac ]} ]; ! MemberQ[ res, 1 ] ] PrimitiveRoots[ p_Integer ] := Select[ Range[ p - 1 ], PrimitiveRootQ[ #, p ] & ] Table[ (Total[ PrimitiveRoots[ Prime[ n ] ] ] - MoebiusMu[ Prime[ n ] - 1 ])/Prime[ n ], {n, 1, 100} ]

CROSSREFS

Sequence in context: A060367 A062968 A053197 this_sequence A011754 A090105 A082146

Adjacent sequences: A088142 A088143 A088144 this_sequence A088146 A088147 A088148

KEYWORD

nonn

AUTHOR

Ed Pegg Jr (edp(AT)wolfram.com), Nov 03 2003

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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research