The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A131470 a(n)=smallest number that gives a product with the sum of digits of n written in base 2 greater than n. 1
2, 3, 2, 5, 3, 4, 3, 9, 5, 6, 4, 7, 5, 5, 4, 17, 9, 10, 7, 11, 8, 8, 6, 13, 9, 9, 7, 10, 8, 8, 7, 33, 17, 18, 12, 19, 13, 13, 10, 21, 14, 15, 11, 15, 12, 12, 10, 25, 17, 17, 13, 18, 14, 14, 12, 19, 15, 15, 12, 16, 13, 13, 11, 65, 33, 34, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
Let sd2(n) the sum of digits of n written in base 2. Then a(n) =1 + Floor(n/sd2(n)).
EXAMPLE
9 is written 1001 in base 2, then sd2(9)=2; 4*2<9<5*2; then (c,9)=5
CROSSREFS
Sequence in context: A111076 A361624 A162398 * A352708 A255709 A285512
KEYWORD
easy,nonn,base
AUTHOR
Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Jul 27 2007
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 20 03:57 EDT 2024. Contains 372703 sequences. (Running on oeis4.)