Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057775
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057775 a(n) is the least prime p such that p-1 is divisible 2^(n-1) and not by 2^n. +0
4
2, 3, 5, 41, 17, 97, 193, 641, 257, 7681, 13313, 18433, 12289, 40961, 114689, 163841, 65537, 1179649, 786433, 5767169, 7340033, 23068673, 104857601, 377487361, 754974721, 167772161, 469762049, 2013265921, 3489660929, 12348030977 (list; graph; listen)
OFFSET

0,1

EXAMPLE

n=13, a(14)=40961=1+8192.5 where the last term is divisible by the 13-th power of 2 and 40961 is the smallest prime with that property.

CROSSREFS

A000040, A006093.

Adjacent sequences: A057772 A057773 A057774 this_sequence A057776 A057777 A057778

Sequence in context: A029499 A128026 A041443 this_sequence A088483 A136015 A106713

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 02 2000

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Nov 03 2000

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 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research