This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309419 Decimal expansion of e/(e-2). 3
 3, 7, 8, 4, 4, 2, 2, 3, 8, 2, 3, 5, 4, 6, 6, 5, 6, 2, 8, 7, 5, 3, 1, 0, 5, 7, 5, 6, 9, 5, 9, 6, 3, 3, 0, 5, 6, 7, 4, 7, 9, 5, 6, 7, 7, 0, 6, 3, 0, 5, 7, 4, 2, 4, 7, 1, 8, 2, 6, 4, 9, 1, 3, 4, 1, 6, 6, 5, 5, 9, 1, 4, 0, 9, 2, 3, 2, 2, 1, 8, 5, 3, 3, 8, 3, 4, 2, 1, 1, 7, 4, 5, 3, 5, 2, 2, 5, 9, 9, 7, 7, 7, 7, 1, 3, 7 (list; constant; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecturally, this can be computed using a recursion formula discovered by an algorithm called "The Ramanujan Machine":                              1     e/(e-2)  =  4 - --------------------                                2                     5 - ----------------                                  3                         6 - ------------                                    4                             7 - --------                                  8 - ...  . LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 Gal Raayoni, George Pisha, Yahel Manor, Uri Mendlovic, Doron Haviv, Yaron Hadad, Ido Kaminer, The Ramanujan Machine: Automatically Generated Conjectures on Fundamental Constants, arXiv:1907.00205 [cs.LG], 2019. The Ramanujan Machine, Using algorithms to discover new mathematics EXAMPLE 3.78442238235466562875310575695963305674795677063... MAPLE nn:= 126: # number of digits # b:= i-> `if`(i

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 21 16:25 EDT 2019. Contains 328302 sequences. (Running on oeis4.)