Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056127
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056127 Minimum m where product_{k=1 to m}[p_k] > (p_{m+1})^n, where p_k is k-th prime. +0
2
1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 15, 16, 18, 19, 20, 21, 23, 24, 25, 26, 28, 29, 30, 32, 33, 34, 35, 36, 38, 39, 40, 41, 43, 44, 45, 46, 48, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 60, 62, 63, 64, 65, 67, 68, 69, 70, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88 (list; graph; listen)
OFFSET

0,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

a(2) = 4, since 2*3*5 < 7^2, but 2*3*5*7 > 11^2. (The product of the first 4 primes is greater than the 5_th prime squared.)

MATHEMATICA

a = {}; Do[x = 1; While[Prime[x + 1] >= (Product[Prime[x], {x, 1, x}])^(1/n), x++ ]; AppendTo[a, x], {n, 1, 100}]; a (*Artur Jasinski*)

CROSSREFS

Cf. A002110, A060797, A127600, A127601, A127602, A127603, A127604, A127605.

Sequence in context: A155902 A059539 A078934 this_sequence A072633 A037087 A062005

Adjacent sequences: A056124 A056125 A056126 this_sequence A056128 A056129 A056130

KEYWORD

nonn

AUTHOR

Leroy Quet Aug 30 2000

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research