login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A365739
a(n)=
A365339
(10^n)-
A365740
(10^n)
0
0, 2, 3, 4, 15, 61, 881, 10394, 111047
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,2
COMMENTS
Pollack et al. conjectured that a(n) > 2 for n > 4.
LINKS
Table of n, a(n) for n=0..8.
Paul Pollack, Carl Pomerance and Enrique Treviño,
Sets of monotonicity for Euler's totient function
, preprint. See M↑(n) and M2(n).
Paul Pollack, Carl Pomerance and Enrique Treviño,
Sets of monotonicity for Euler's totient function
, Ramanujan J. 30 (2013), no. 3, 379--398.
Terence Tao,
Monotone non-decreasing sequences of the Euler totient function
, arXiv:2309.02325 [math.NT], 2023.
CROSSREFS
Cf.
A000010
,
A000720
.
Cf.
A365339
,
A365398
,
A365399
,
A365400
,
A365474
,
A365737
,
A061070
.
Sequence in context:
A362639
A348628
A281586
*
A217714
A076965
A370694
Adjacent sequences:
A365736
A365737
A365738
*
A365740
A365741
A365742
KEYWORD
nonn
,
hard
,
more
AUTHOR
Chai Wah Wu
, Sep 17 2023
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified July 25 15:49 EDT 2024. Contains 374612 sequences. (Running on oeis4.)