The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074718 Least k such that floor(3^n/k) is prime. 1
 1, 3, 2, 6, 14, 23, 2, 6, 11, 14, 14, 32, 2, 6, 5, 15, 14, 42, 5, 7, 21, 63, 25, 61, 19, 53, 97, 38, 19, 55, 32, 23, 69, 110, 38, 114, 115, 31, 5, 15, 45, 29, 77, 7, 21, 63, 189, 37, 111, 226, 14, 42, 113, 44, 5, 15, 45, 135, 14, 38, 114, 137, 32, 37, 49, 147, 5, 15, 45, 79, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS From Robert Israel, Jan 03 2017: (Start) a(n+1) <= 3*a(n), with equality if and only if a(n+1) is divisible by 3. For n > 1, a(n) <= floor(3^n/p) where p is the greatest prime <= 3^(n/2)-1. a(n) = 2 if and only if n is in A028491. (End) LINKS Robert Israel, Table of n, a(n) for n = 1..2000 MAPLE f:= proc(n) local t, k;    t:= 3^n;    for k from 2 to t/3 do if isprime(floor(t/k)) then return k fi od: end proc: f(1):= 1: map(f, [\$1..100]); # Robert Israel, Jan 03 2017 PROG (PARI) a(n)=if(n<0, 0, k=1; while(isprime(floor(3^n/k))==0, k++); k) CROSSREFS Cf. A028491. Sequence in context: A248982 A333446 A289069 * A285457 A007812 A276225 Adjacent sequences:  A074715 A074716 A074717 * A074719 A074720 A074721 KEYWORD easy,nonn AUTHOR Benoit Cloitre, Sep 04 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 19:48 EDT 2020. Contains 337265 sequences. (Running on oeis4.)