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!)
A218620 Least number m to appear exactly n times in A095972. 1
7, 1, 0, 2, 18, 128, 443, 2666, 1353, 2706 (list; graph; refs; listen; history; text; internal format)
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

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

CROSSREFS

Sequence in context: A194655 A197037 A256778 * A195911 A231096 A240907

Adjacent sequences:  A218617 A218618 A218619 * A218621 A218622 A218623

KEYWORD

nonn,more

AUTHOR

M. F. Hasler, Nov 03 2012

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 19:51 EST 2019. Contains 329879 sequences. (Running on oeis4.)