id:A053336 - OEIS Search Results

Search: id:A053336

Displaying 1-1 of 1 results found.

page 1

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

+0
1

6, 56, 656, 6656, 66656, 566656, 6566656, 66566656, 666566656, 6666566656, 56666566656, 656666566656, 6656666566656, 66656666566656, 566656666566656, 6566656666566656, 56566656666566656, 556566656666566656 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=a(n-1)+10^(n-1)*(6-[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 5.`
	CROSSREFS	`Cf. A023408, A050621, A050622, A035014.` `Sequence in context: A099140 A048348 A025749 this_sequence A112699 A093197 A052317` `Adjacent sequences: A053333 A053334 A053335 this_sequence A053337 A053338 A053339`
	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