id:A131470 - OEIS Search Results

Search: id:A131470

Displaying 1-1 of 1 results found.

page 1

a(n)=smallest number that gives a product with the sum of digits of n written in base 2 greater than n.

+0
2

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; listen)

	OFFSET	`1,1`
	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; 42<9<52; then (c,9)=5`
	CROSSREFS	`Sequence in context: A064886 A029600 A111076 this_sequence A026235 A086281 A097975` `Adjacent sequences: A131467 A131468 A131469 this_sequence A131471 A131472 A131473`
	KEYWORD	`easy,nonn`
	AUTHOR	`Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Jul 27 2007`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research