id:A053376 - OEIS Search Results

Search: id:A053376

Displaying 1-1 of 1 results found.

page 1

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

+0
1

8, 88, 888, 1888, 81888, 181888, 8181888, 18181888, 118181888, 8118181888, 88118181888, 888118181888, 8888118181888, 88888118181888, 888888118181888, 1888888118181888, 81888888118181888, 181888888118181888 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=a(n-1)+10^(n-1)(8-7[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 an 8, if not then n-th term begins with a 1.`
	CROSSREFS	`Cf. A023411, A050621, A050622, A035014.` `Sequence in context: A109021 A043043 A003492 this_sequence A053377 A053378 A062185` `Adjacent sequences: A053373 A053374 A053375 this_sequence A053377 A053378 A053379`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research