Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110146
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110146 n^(n+1) mod n+2. +0
3
0, 1, 0, 1, 4, 1, 0, 4, 8, 1, 4, 1, 12, 4, 0, 1, 4, 1, 12, 4, 20, 1, 16, 16, 24, 13, 20, 1, 28, 1, 0, 4, 32, 9, 4, 1, 36, 4, 32, 1, 10, 1, 36, 31, 44, 1, 16, 15, 38, 4, 44, 1, 40, 49, 40, 4, 56, 1, 52, 1, 60, 4, 0, 16, 34, 1, 60, 4, 48, 1, 40, 1, 72, 34, 68, 9, 46, 1, 32, 40, 80, 1, 52, 16, 84 (list; graph; listen)
OFFSET

0,5

FORMULA

a(n) = 0 just if n = 2^k-2.

MATHEMATICA

Table[PowerMod[n, n+1, n+2], {n, 0, 120}]

CROSSREFS

A040976 gives n such A110146(n)=1.

Sequence in context: A021713 A122388 A094918 this_sequence A126217 A108944 A117377

Adjacent sequences: A110143 A110144 A110145 this_sequence A110147 A110148 A110149

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Jul 14 2005

page 1

Search completed in 0.005 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.


AT&T Labs Research