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!)
A193497 a(n) = 1, if digit n+1 of e is greater than or equal to digit n of e, else 0. 1
1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1

COMMENTS

If A001113(n+1) >= A001113(n) then a(n)=1, else a(n)=0.

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..5000

EXAMPLE

a(1) = 1 because A001113(2)=7 > A001113(1)=2.

MAPLE

N:= 100: # to get a(1) to a(n)

q:= 3:

S:= convert(evalf[N+q](exp(1)/10), string):

while S[N+1..N+q] = StringTools:-Fill("0", q) do

q:= q+1;

S:= convert(evalf[N+q](exp(1)/10), string):

od:

seq(`if`(S[i+1]>S[i], 1, 0), i=1..N); # Robert Israel, Jan 09 2015

MATHEMATICA

nn = 100; d = RealDigits[N[E, nn]][[1]]; Table[Boole[d[[n + 1]] >= d[[n]]], {n, nn - 1}] (* T. D. Noe, Jul 29 2011 *)

CROSSREFS

Cf. A001113 (decimal expansion of e).

Sequence in context: A091337 A166698 A250299 * A260390 A179758 A287795

Adjacent sequences:  A193494 A193495 A193496 * A193498 A193499 A193500

KEYWORD

nonn,base

AUTHOR

Alexander R. Povolotsky, Jul 28 2011

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 15 20:00 EST 2019. Contains 330000 sequences. (Running on oeis4.)