login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138714 Add 1, modulo 10, to the decimal expansion of e, A001113. 0
3, 8, 2, 9, 3, 9, 2, 9, 3, 9, 5, 6, 0, 1, 5, 6, 3, 4, 6, 4, 7, 1, 3, 9, 8, 5, 8, 2, 4, 6, 3, 7, 7, 3, 5, 0, 8, 8, 6, 8, 3, 5, 8, 1, 0, 4, 7, 0, 0, 0, 6, 0, 6, 8, 5, 0, 7, 7, 0, 7, 8, 7, 3, 8, 8, 3, 5, 1, 8, 7, 7, 4, 1, 4, 6, 4, 6, 5, 8, 6, 0, 5, 6, 8, 2, 4, 9, 3, 2, 8, 9, 6, 3, 6, 2, 7, 7, 5, 3, 8, 5, 3, 8, 5, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..104.

MATHEMATICA

Mod[# + 1, 10] & /@ First@ RealDigits@ N[E, 105] (* Michael De Vlieger, Apr 01 2015 *)

PROG

(Sage) [(floor((1+e*10^n))%10) for n in range(105)] # Danny Rorabaugh, Apr 01 2015

CROSSREFS

Cf. A001113, A059833.

Sequence in context: A016669 A094964 A197144 * A038755 A245171 A011230

Adjacent sequences:  A138711 A138712 A138713 * A138715 A138716 A138717

KEYWORD

easy,nonn,base

AUTHOR

Felix Tubiana (fat2(AT)columbia.edu), May 15 2008

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)