Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108500
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108500 Number of values of k (1<=k<=n) where k^(n+1) != k mod n, or equivalently where sum_i{1<=i<=n} k^i != 0 mod n. +0
2
0, 0, 1, 1, 3, 0, 5, 3, 5, 4, 9, 3, 11, 8, 11, 7, 15, 4, 17, 5, 13, 16, 21, 9, 19, 20, 17, 19, 27, 12, 29, 15, 29, 28, 31, 15, 35, 32, 31, 15, 39, 0, 41, 35, 37, 40, 45, 21, 41, 28, 47, 37, 51, 16, 43, 41, 49, 52, 57, 15, 59, 56, 47, 31, 61, 48, 65, 53, 65, 52, 69, 37, 71, 68, 63, 67 (list; graph; listen)
OFFSET

1,5

FORMULA

a(n)=n-A108499(n). a(n)=0 iff n is in A014117. a(p)=p-2 for p prime.

EXAMPLE

a(2)=0 since 1^3 = 1 mod 2 and 2^3 = 8 = 0 mod 2 = 2 mod 2.

a(3)=1 since 2^1+2^2+2^3 = 14 = 2 mod 3 != 0 mod 3 but 1^1+1^2+1^3 = 3 = 0 mod 3 and 3^1+3^2+3^3 = 39 = 0 mod 3.

CROSSREFS

Numbers of nonzeros in rows of A108497 or A108498.

Adjacent sequences: A108497 A108498 A108499 this_sequence A108501 A108502 A108503

Sequence in context: A098496 A011293 A088191 this_sequence A076109 A078788 A005069

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 06 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 October 8 07:34 EDT 2008. Contains 144666 sequences.


AT&T Labs Research