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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A362769 Minimum number of digits required to represent n only using digits present in n. 2
1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 7, 4, 4, 4, 3, 5, 5, 4, 3, 5, 6, 6, 4, 3, 2, 4, 4, 4, 4, 3, 4, 3, 4, 4, 4, 2, 4, 4, 4, 5, 5, 5, 4, 5, 3, 4, 5, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 3, 4, 3, 4, 4, 5, 5, 4, 5, 5, 5, 4, 4, 4, 6, 6, 4, 4, 4, 4, 4, 5, 5, 4, 5, 5, 5, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 8, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,10
COMMENTS
The only operations allowed are addition, subtraction, multiplication, division, exponentiation, and parenthesizing. Concatenation is not allowed.
LINKS
Valentin Miakinen, Python program
EXAMPLE
For n = 10, a solution for a(10)=6 is (1+1+1)^(1+1)+1.
For n = 27, a solution for a(27)=4 is 2+(2-7)^2.
PROG
(Python) # See Miakinen link.
CROSSREFS
Cf. A043537.
Sequence in context: A195792 A242670 A196761 * A195776 A092678 A019932
KEYWORD
nonn,base
AUTHOR
Oskar Macholl, Valentin Miakinen, and Walter Robinson, May 02 2023
EXTENSIONS
Edited by N. J. A. Sloane, Oct 16 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 May 2 12:49 EDT 2024. Contains 372196 sequences. (Running on oeis4.)