Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082495
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082495 (2^n-1) mod n. +0
5
0, 1, 1, 3, 1, 3, 1, 7, 7, 3, 1, 3, 1, 3, 7, 15, 1, 9, 1, 15, 7, 3, 1, 15, 6, 3, 25, 15, 1, 3, 1, 31, 7, 3, 17, 27, 1, 3, 7, 15, 1, 21, 1, 15, 16, 3, 1, 15, 29, 23, 7, 15, 1, 27, 42, 31, 7, 3, 1, 15, 1, 3, 7, 63, 31, 63, 1, 15, 7, 43, 1, 63, 1, 3, 67, 15, 17, 63, 1, 15, 79, 3, 1, 63, 31, 3, 7, 79 (list; graph; listen)
OFFSET

1,4

CROSSREFS

a(n) = A015910(n) + A048298(n)-1.

Sequence in context: A095250 A135521 A122410 this_sequence A016572 A072860 A068503

Adjacent sequences: A082492 A082493 A082494 this_sequence A082496 A082497 A082498

KEYWORD

easy,nonn

AUTHOR

anon, Apr 28 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research