login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074717 Least k such that floor(2^n/k) is prime. 0
1, 2, 3, 3, 6, 9, 11, 11, 7, 9, 5, 10, 19, 11, 5, 10, 9, 11, 22, 35, 39, 9, 5, 10, 20, 27, 11, 19, 9, 18, 36, 25, 29, 27, 5, 10, 20, 40, 61, 13, 21, 42, 29, 27, 39, 9, 17, 29, 58, 49, 27, 25, 50, 11, 22, 44, 39, 11, 22, 44, 29, 58, 116, 53, 19, 38, 76, 152, 237, 139, 5, 10, 20 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

There is probably a constant c such that sum(i=1, n, a(i)) is asymptotic to c*n^2 ( 0<c<1/2)

PROG

(PARI) a(n)=if(n<0, 0, k=1; while(isprime(floor(2^n/k)) == 0, k++); k)

CROSSREFS

Sequence in context: A027100 A183560 A060840 * A129068 A079888 A165257

Adjacent sequences:  A074714 A074715 A074716 * A074718 A074719 A074720

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 04 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 08:12 EST 2012. Contains 205451 sequences.