id:A053337 - OEIS Search Results

Search: id:A053337

Displaying 1-1 of 1 results found.

page 1

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

+0
1

6, 76, 776, 7776, 67776, 667776, 6667776, 66667776, 766667776, 6766667776, 66766667776, 666766667776, 7666766667776, 77666766667776, 777666766667776, 7777666766667776, 77777666766667776, 777777666766667776 (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 7.`
	CROSSREFS	`Cf. A023409, A050621, A050622, A035014.` `Sequence in context: A081066 A016090 A137132 this_sequence A066797 A120593 A116874` `Adjacent sequences: A053334 A053335 A053336 this_sequence A053338 A053339 A053340`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research