Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124402
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124402 Numbers n such that mod(3^n,2^n) is less than mod(3^(n-1),2^(n-1)). +0
1
4, 7, 17, 20, 24, 27, 29, 40, 45, 48, 49, 53, 55, 57, 61, 62, 65, 67, 72, 76, 79, 82, 83, 85, 88, 91, 95, 100, 101, 106, 107, 109, 112, 119, 124, 136, 139, 142, 149, 151, 153, 158, 159, 164, 165, 167, 171, 178, 186, 189, 193, 197, 198, 202, 204, 209, 210, 215, 219 (list; graph; listen)
OFFSET

1,1

COMMENT

Also positions where A002380(n) < A002380(n-1).

The first occurrence of k in the first forward difference: 48, 27, 4, 20, 40, 358, 112, 178, 222, 7, ...,.

EXAMPLE

1 == 3^4 (mod 2^4) which is less than 3 == 3^3 (mod 2^3) so 4 is a member.

MATHEMATICA

pm = 0; lst = {}; Do[pn = PowerMod[3, n, 2^n]; If[pn < pm, AppendTo[lst, n]]; pm = pn, {n, 221}]; lst

CROSSREFS

Cf. A002380.

Sequence in context: A132334 A097661 A013625 this_sequence A034736 A023860 A009881

Adjacent sequences: A124399 A124400 A124401 this_sequence A124403 A124404 A124405

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 14 2006

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