Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097099
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097099 Least k such that (2^k)*P(n)# - 1 is prime, where P(i)=i-th prime and P(i)# =i-th primorial. +0
2
1, 1, 1, 1, 2, 6, 1, 1, 2, 3, 12, 1, 2, 22, 2, 4, 13, 12, 6, 1, 4, 1, 4, 9, 2, 9, 5, 6, 2, 1, 9, 17, 22, 7, 19, 73, 23, 12, 5, 27, 33, 64, 33, 5, 7, 41, 44, 35, 29, 3, 19, 6, 26, 5, 11, 9, 33, 34, 16, 63, 46, 8, 4, 24, 48, 32, 11, 29, 26, 6, 25, 17, 31, 6, 46, 33, 46, 17, 8, 61, 12, 23, 76 (list; graph; listen)
OFFSET

1,5

MATHEMATICA

f[n_] := Block[{k = 1, p = Product[Prime[i], {i, n}]}, While[ !PrimeQ[2^k*p - 1], k++ ]; k]; Table[ f[n], {n, 83}] (from Robert G. Wilson v Sep 27 2004)

CROSSREFS

Sequence in context: A127508 A090185 A059813 this_sequence A065529 A126749 A024573

Adjacent sequences: A097096 A097097 A097098 this_sequence A097100 A097101 A097102

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Sep 15 2004

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 27 2004

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research