id:A053335 - OEIS Search Results

Search: id:A053335

Displaying 1-1 of 1 results found.

page 1

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

+0
1

6, 36, 336, 6336, 66336, 366336, 6366336, 36366336, 636366336, 3636366336, 33636366336, 333636366336, 3333636366336, 33333636366336, 633333636366336, 3633333636366336, 33633333636366336, 333633333636366336 (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 3.`
	CROSSREFS	`Cf. A023407, A050621, A050622, A035014.` `Sequence in context: A098559 A129584 A052559 this_sequence A108733 A137889 A071555` `Adjacent sequences: A053332 A053333 A053334 this_sequence A053336 A053337 A053338`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.

AT&T Labs Research