|
|
A218620
|
|
Least number m to appear exactly n times in A095972.
|
|
1
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
One has n/2 <= A095972(n)+1 <= n, therefore an integer m can appear in A095972 only between indices m and 2m, and this sequence is effectively computable.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|