Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101507
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101507 Numbers n such that exp(n) has a smaller relative error abs(exp(n)/m!-1) in approximating the closest factorial m!>1 than exp(k) for any k with 1<k<n. +0
2
2, 3, 15, 20, 58, 2893, 3172, 13778, 36596, 63894, 208744, 296557, 404667, 11500740, 17800369, 37858613, 38393813, 902477623, 4126573365, 79491128275, 338814192247, 1599109448865 (list; graph; listen)
OFFSET

1,1

COMMENT

Numbers n such that abs(exp(n)/m!-1)<abs(exp(k)/j!-1) with m such that abs(exp(n)-m!)=min for any k with 1<k<n and j such that abs(exp(k)-j!)=min.

EXAMPLE

a(1)=2 because exp(2)=7.389 is a better approximation to the nearest factorial 3!=6 with +23% relative error than is exp(1)=2.718 for its closest factorial 2!=2 with +36% relative error.

a(2)=3: exp(3)/4!-1=-0.1631. The next improvement occurs for a(3)=15 because exp(15)/10!-1=-0.099.

a(22)=1599109448865: The relative error of exp(1599109448865) in approximating A101506(22)!=66836971558! is 1.276*10^(-12).

CROSSREFS

Cf. A101506.

Adjacent sequences: A101504 A101505 A101506 this_sequence A101508 A101509 A101510

Sequence in context: A088030 A101047 A066491 this_sequence A047176 A037175 A048613

KEYWORD

more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Dec 20 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research