id:A086223 - OEIS Search Results

Search: id:A086223

Displaying 1-1 of 1 results found.

page 1

Every integer can be represented uniquely as m = k*2^(j+1)+2^j-1. Sequence gives values of k for m = repunit(n).

+0
1

0, 1, 3, 69, 694, 6944, 69444, 694444, 6944444, 69444444, 694444444, 6944444444, 69444444444, 694444444444, 6944444444444, 69444444444444, 694444444444444, 6944444444444444, 69444444444444444, 694444444444444444 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`j = A007814(m+1).`
	FORMULA	`a(n) = A025480(A002275(n)).`
	EXAMPLE	`1 = 04+1; 11 = 18+3; 111 = 332+15.` `For n > 3, repunit(n) = [6910^(n-4)+(10^(n-4)-1)4/9]16+7.`
	CROSSREFS	`Cf. A002275, A007814, A025480.` `Sequence in context: A073163 A124181 A046432 this_sequence A089455 A012201 A012096` `Adjacent sequences: A086220 A086221 A086222 this_sequence A086224 A086225 A086226`
	KEYWORD	`nonn,easy`
	AUTHOR	`Marco Matosic (marcomatosic(AT)hotmail.com), Jul 27 2003`
	EXTENSIONS	`Edited and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Feb 17 2005`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research