Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074718
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074718 Least k such that floor(3^n/k) is prime. +0
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; listen)
OFFSET

1,2

PROGRAM

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

CROSSREFS

Sequence in context: A078088 A078091 A073883 this_sequence A007812 A082561 A110768

Adjacent sequences: A074715 A074716 A074717 this_sequence A074719 A074720 A074721

KEYWORD

easy,nonn

AUTHOR

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

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research