id:A053334 - OEIS Search Results

Search: id:A053334

Displaying 1-1 of 1 results found.

page 1

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

+0
1

6, 16, 616, 1616, 11616, 111616, 6111616, 16111616, 616111616, 1616111616, 61616111616, 661616111616, 1661616111616, 61661616111616, 661661616111616, 6661661616111616, 66661661616111616, 666661661616111616 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=a(n-1)+10^(n-1)(6-5[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 1.`
	CROSSREFS	`Cf. A023406, A050621, A050622, A035014.` `Sequence in context: A113561 A080809 A118949 this_sequence A001143 A138490 A022510` `Adjacent sequences: A053331 A053332 A053333 this_sequence A053335 A053336 A053337`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research