Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096196
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096196 a[n]=Mod[1+2^n,n]. +0
1
0, 1, 0, 1, 3, 5, 3, 1, 0, 5, 3, 5, 3, 5, 9, 1, 3, 11, 3, 17, 9, 5, 3, 17, 8, 5, 0, 17, 3, 5, 3, 1, 9, 5, 19, 29, 3, 5, 9, 17, 3, 23, 3, 17, 18, 5, 3, 17, 31, 25, 9, 17, 3, 29, 44, 33, 9, 5, 3, 17, 3, 5, 9, 1, 33, 65, 3, 17, 9, 45, 3, 65, 3, 5, 69, 17, 19, 65, 3, 17, 0, 5, 3, 65, 33, 5, 9, 81, 3 (list; graph; listen)
OFFSET

1,5

CROSSREFS

Cf. A082495, A006521, A087611.

Sequence in context: A130847 A010615 A114865 this_sequence A076824 A103728 A023505

Adjacent sequences: A096193 A096194 A096195 this_sequence A096197 A096198 A096199

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 26 2004

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 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research