login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A272760 a(n) = A065880(n)/n. 3
1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 5, 2, 0, 3, 4, 1, 2, 2, 0, 2, 6, 5, 5, 2, 0, 0, 4, 3, 4, 4, 5, 1, 2, 2, 0, 2, 6, 0, 4, 2, 6, 6, 4, 5, 4, 5, 0, 2, 0, 0, 4, 0, 6, 4, 0, 3, 5, 4, 5, 4, 6, 5, 6, 1, 2, 2, 0, 2, 6, 0, 5, 2, 6, 6, 4, 0, 6, 4, 6, 2, 6, 6, 6, 6, 5, 4, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

This sequence is bounded above by A272756.

a(n) is the greatest value i such that A000120(n * i) = i or 0 if no such value exists.

LINKS

Peter Kagey, Table of n, a(n) for n = 1..10000

MATHEMATICA

Table[SelectFirst[Reverse@ Range@ #, First@ DigitCount[#, 2] == #/n &] &[n SelectFirst[Range[2^12], # > IntegerLength[n #, 2] &]]/n, {n, 120}] /. k_ /; MissingQ@ k -> 0 (* Michael De Vlieger, May 05 2016, Version 10.2 *)

CROSSREFS

Cf. A065880, A272756, A272759.

Sequence in context: A335474 A333939 A272759 * A054717 A086421 A290399

Adjacent sequences: A272757 A272758 A272759 * A272761 A272762 A272763

KEYWORD

nonn,base

AUTHOR

Peter Kagey, May 05 2016

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 November 27 19:48 EST 2022. Contains 358406 sequences. (Running on oeis4.)