id:A053338 - OEIS Search Results

Search: id:A053338

Displaying 1-1 of 1 results found.

page 1

a(n) contains n digits (either '6' or '9') and is divisible by 2^n.

+0
1

6, 96, 696, 9696, 69696, 669696, 6669696, 96669696, 696669696, 9696669696, 69696669696, 969696669696, 9969696669696, 69969696669696, 969969696669696, 9969969696669696, 99969969696669696, 999969969696669696 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=a(n-1)+10^(n-1)(6+3[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends with a(n-1); if (n-1)-th term is divisible by 2^n then n-th term begins with a 6, if not then n-th term begins with a 9.`
	CROSSREFS	`Cf. A023410, A050621, A050622, A035014.` `Sequence in context: A116158 A116289 A116256 this_sequence A055358 A030989 A006044` `Adjacent sequences: A053335 A053336 A053337 this_sequence A053339 A053340 A053341`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research