id:A053312 - OEIS Search Results

Search: id:A053312

Displaying 1-1 of 1 results found.

page 1

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

+0
2

2, 12, 112, 2112, 22112, 122112, 2122112, 12122112, 212122112, 1212122112, 11212122112, 111212122112, 1111212122112, 11111212122112, 211111212122112, 1211111212122112, 11211111212122112, 111211111212122112 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=a(n-1)+10^(n-1)*(2-[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 2, if not then n-th term begins with a 1.`
	CROSSREFS	`Cf. A023396, A050621, A050622, A035014.` `Sequence in context: A124213 A143134 A091481 this_sequence A091854 A141141 A128571` `Adjacent sequences: A053309 A053310 A053311 this_sequence A053313 A053314 A053315`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research