Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107610
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107610 Least number n such that n divided by Pi(n) rounded is greater than any previous n. +0
3
2, 16, 56, 190, 556, 1821, 4928, 14136, 39017, 107405, 291330, 791513, 2148323, 5797898, 15726486, 42605113, 115371428, 312629484, 847000031, 2295700537, 6223257066, 16874397811, 45764114391, 124142354193, 336811260666 (list; graph; listen)
OFFSET

2,1

COMMENT

First occurrence of k in A107609.

Lim_n->inf. a(n+1)/a(n)=~e.

FORMULA

a(n) = round( n / Pi(n)).

EXAMPLE

a(2)=16 because round(16/6)=3 and for no other number less than 16 does the quotient equal 3.

MATHEMATICA

f[n_] := Round[ n / PrimePi[ n]]; g[2] = 2; g[n_] := g[n] = Block[{k = PrimePi[E g[n - 1]]}, While[ f[k] < n, k++ ]; k]; Do[ Print[ g[ n]], {n, 2, 26}]

CROSSREFS

Cf. A107609, A107614.

Sequence in context: A006885 A027273 A033431 this_sequence A091914 A123791 A152665

Adjacent sequences: A107607 A107608 A107609 this_sequence A107611 A107612 A107613

KEYWORD

nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), May 17 2005

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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research