id:A053315 - OEIS Search Results

Search: id:A053315

Displaying 1-1 of 1 results found.

page 1

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

+0
1

4, 44, 544, 4544, 44544, 444544, 4444544, 54444544, 454444544, 5454444544, 45454444544, 545454444544, 5545454444544, 55545454444544, 555545454444544, 4555545454444544, 44555545454444544, 544555545454444544 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=a(n-1)+10^(n-1)*(4+[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 7.`
	CROSSREFS	`Cf. A023403, A050621, A050622, A035014.` `Sequence in context: A112897 A087813 A082779 this_sequence A005721 A056063 A053332` `Adjacent sequences: A053312 A053313 A053314 this_sequence A053316 A053317 A053318`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research