Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074720
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074720 Least k such that floor(3^n/2^k) is prime. +0
1
2, 1, 4, 5, 6, 1, 11, 6, 7, 4, 5, 1, 9, 6, 8, 21, 8, 4, 25, 12, 20, 13, 30, 17, 6, 13, 10, 13, 19, 5, 12, 34, 33, 37, 16, 39, 35, 13, 38, 30, 28, 20, 53, 16, 60, 24, 40, 43, 34, 19, 23, 32, 63, 59, 19, 22, 27, 56, 86, 14, 29, 5, 53, 13, 15, 63, 19, 7, 88, 1, 87, 46, 22, 51, 25, 30 (list; graph; listen)
OFFSET

2,1

PROGRAM

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

CROSSREFS

Sequence in context: A047949 A075423 A144774 this_sequence A058359 A110332 A159287

Adjacent sequences: A074717 A074718 A074719 this_sequence A074721 A074722 A074723

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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research