|
Search: id:A139338
|
|
|
| A139338 |
|
Least k>0 such that sum(i=0,2*n-1,(-k)^i/i!)<0. |
|
+0
1
|
|
| 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 11, 11, 12, 12, 13, 13, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 20, 20, 21, 21, 22, 22, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38, 39, 39, 40, 40, 41, 41, 42, 43
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Serge Francinou, Herve Gianella and Serge Nicolas, Exercices de mathematiques : oraux X-ENS, Analyse 1, Cassini Editeur, 2003, p. 119-121
|
|
FORMULA
|
a(n)=r*n+o(n) where r is the solution to x+log(x)=0 and 0<x<1 : r=0.56714329040978387299996...(see A030178)
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, k=1; while(sum(i=0, 2*n-1, (-k)^i*1./i!)>0, k++); k)
|
|
CROSSREFS
|
Cf. A030178.
Sequence in context: A065603 A084242 A071823 this_sequence A057355 A073869 A055930
Adjacent sequences: A139335 A139336 A139337 this_sequence A139339 A139340 A139341
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 08 2008
|
|
|
Search completed in 0.002 seconds
|
