Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054850
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054850 a(n)=m such that 2^m <= p(n)# <= 2^(m+1), where p(n)# is primorial of the n-th prime (A002110). +0
5
1, 2, 4, 7, 11, 14, 18, 23, 27, 32, 37, 42, 48, 53, 59, 64, 70, 76, 82, 88, 95, 101, 107, 114, 120, 127, 134, 140, 147, 154, 161, 168, 175, 182, 189, 197, 204, 211, 219, 226, 234, 241, 249, 256, 264, 272, 279, 287, 295, 303, 311, 318, 326, 334, 342, 350, 358, 367 (list; graph; listen)
OFFSET

1,2

COMMENT

A measure of the growth rate of the primorials.

MATHEMATICA

Table[ Floor[ Log[2, Product[ Prime[i], {i, 1, n}]]], {n, 1, 60}]

CROSSREFS

Cf. A002110, A058033.

Equals A045716(n)-1.

Sequence in context: A086795 A064690 A138766 this_sequence A027427 A018385 A087163

Adjacent sequences: A054847 A054848 A054849 this_sequence A054851 A054852 A054853

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), May 22 2003

EXTENSIONS

Edited, corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), May 22 2003

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research